Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
David C. Fisher
2000 – 2009
- 2003
[j24]David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid: Domination Graphs of Tournaments with Isolated Vertices. Ars Comb. 66 (2003)
[j23]- 2002
[j22]
[j21]David C. Fisher: Fractional dominations and fractional total dominations of graph complements. Discrete Applied Mathematics 122(1-3): 283-291 (2002)
[j20]David C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager: The Domination Number of Cubic Graphs with Girth at least Five. Electronic Notes in Discrete Mathematics 11: 751-759 (2002)- 2001
[j19]David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam: Two families of graphs that are not CCE-orientable. Ars Comb. 58 (2001)
[j18]David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid: Domination Graphs with Nontrivial Components. Graphs and Combinatorics 17(2): 227-236 (2001)
1990 – 1999
- 1998
[j17]David C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer: Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs. Discrete Applied Mathematics 84(1-3): 93-105 (1998)
[j16]David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid: The domination and competition graphs of a tournament. Journal of Graph Theory 29(2): 103-110 (1998)- 1997
[j15]David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley: P3-Connected Graphs of Minimum Size. Ars Comb. 47 (1997)
[j14]David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley, Douglas B. West: The Number of Dependent Arcs in an Acyclic Orientation. J. Comb. Theory, Ser. B 71(1): 73-78 (1997)- 1996
[j13]David C. Fisher: Squaring a tournament: A proof of Dean's conjecture. Journal of Graph Theory 23(1): 43-48 (1996)- 1995
[j12]David C. Fisher, Jennifer Ryan: Probabilities Within optimal Strategies for Tournament Games. Discrete Applied Mathematics 56(1): 87-91 (1995)
[j11]Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary: Size in maximal triangle-free graphs and minimal graphs of diameter 2. Discrete Mathematics 138(1-3): 93-99 (1995)
[j10]David C. Fisher, Jennifer Ryan: Tournament games and positive tournaments. Journal of Graph Theory 19(2): 217-236 (1995)
[j9]David C. Fisher: Fractional colorings with large denominators. Journal of Graph Theory 20(4): 403-409 (1995)- 1994
[j8]David C. Fisher, Jennifer Ryan, Gayla S. Domke, Aniket Majumdar: Fractional domination of strong direct products. Discrete Applied Mathematics 50(1): 89-91 (1994)
[j7]David C. Fisher: Domination, Fractional Domination, 2-Packing, and Graph Products. SIAM J. Discrete Math. 7(3): 493-498 (1994)- 1992
[j6]David C. Fisher, Jennifer Ryan: Bounds on the number of complete subgraphs. Discrete Mathematics 103(3): 313-320 (1992)
[j5]David C. Fisher, Jennifer Ryan: Bounds on the largest root of the matching polynomial. Discrete Mathematics 110(1-3): 275-278 (1992)- 1990
[j4]
1980 – 1989
- 1989
[j3]David C. Fisher: Lower bounds on the number of triangles in a graph. Journal of Graph Theory 13(4): 505-512 (1989)- 1988
[j2]David C. Fisher: The number of triangles in a K4-free graph. Discrete Mathematics 69(2): 203-205 (1988)
[j1]David C. Fisher: Your Favorite Parallel Algorithms Might Not Be as Fast as You Think. IEEE Trans. Computers 37(2): 211-213 (1988)- 1987
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-10 21:57 CEST by the dblp team



