David C. Fisher

26 papers Journal 25Unranked 1

Year	Rank	Type	Title / Venue / Authors
2004	J	`jnl`	Some remarks on domination. J. Graph Theory Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster
2003	J	`jnl`	Domination Graphs of Tournaments with Isolated Vertices. Ars Comb. David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid
2003	J	`jnl`	On the n x n Knight Cover Problem. Ars Comb. David C. Fisher
2002	J	`jnl`	Bishop Covers of Rectangular Boards. Ars Comb. David C. Fisher, Paul Thalos
2002	J	`jnl`	Fractional dominations and fractional total dominations of graph complements. Discret. Appl. Math. David C. Fisher
2002	J	`jnl`	The Domination Number of Cubic Graphs with Girth at least Five. Electron. Notes Discret. Math. David C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager
2001	J	`jnl`	Domination Graphs with Nontrivial Components. Graphs Comb. David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid
2001	J	`jnl`	Two families of graphs that are not CCE-orientable. Ars Comb. David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam
1998	J	`jnl`	Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs. Discret. Appl. Math. David C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer
1998	J	`jnl`	The domination and competition graphs of a tournament. J. Graph Theory David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid
1997	J	`jnl`	P3-Connected Graphs of Minimum Size. Ars Comb. David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley
1997	J	`jnl`	The Number of Dependent Arcs in an Acyclic Orientation. J. Comb. Theory B David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley, Douglas B. West
1996	J	`jnl`	Squaring a tournament: A proof of Dean's conjecture. J. Graph Theory David C. Fisher
1995	J	`jnl`	Fractional colorings with large denominators. J. Graph Theory David C. Fisher
1995	J	`jnl`	Probabilities Within optimal Strategies for Tournament Games. Discret. Appl. Math. David C. Fisher, Jennifer Ryan
1995	J	`jnl`	Size in maximal triangle-free graphs and minimal graphs of diameter 2. Discret. Math. Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary
1995	J	`jnl`	Tournament games and positive tournaments. J. Graph Theory David C. Fisher, Jennifer Ryan
1994	J	`jnl`	Domination, Fractional Domination, 2-Packing, and Graph Products. SIAM J. Discret. Math. David C. Fisher
1994	J	`jnl`	Fractional domination of strong direct products. Discret. Appl. Math. David C. Fisher, Jennifer Ryan, Gayla S. Domke, Aniket Majumdar
1992	J	`jnl`	Bounds on the largest root of the matching polynomial. Discret. Math. David C. Fisher, Jennifer Ryan
1992	J	`jnl`	Bounds on the number of complete subgraphs. Discret. Math. David C. Fisher, Jennifer Ryan
1990	J	`jnl`	Dependence polynomials. Discret. Math. David C. Fisher, Anita E. Solow
1989	J	`jnl`	Lower bounds on the number of triangles in a graph. J. Graph Theory David C. Fisher
1988	J	`jnl`	The number of triangles in a K Discret. Math. David C. Fisher
1988	J	`jnl`	Your Favorite Parallel Algorithms Might Not Be as Fast as You Think. IEEE Trans. Computers David C. Fisher
1987	—	`conf`	Communication Complexity of Matrix Multiplication-Abstract. PP David C. Fisher