David C. Fisher

According to our database, David C. Fisher authored at least 26 papers between 1987 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2004

Some remarks on domination.

Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster

J. Graph Theory, 2004

2003

Domination Graphs of Tournaments with Isolated Vertices.

David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid

Ars Comb., 2003

On the n x n Knight Cover Problem.

David C. Fisher

Ars Comb., 2003

2002

The Domination Number of Cubic Graphs with Girth at least Five.

David C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager

Electron. Notes Discret. Math., 2002

Fractional dominations and fractional total dominations of graph complements.

David C. Fisher

Discret. Appl. Math., 2002

Bishop Covers of Rectangular Boards.

David C. Fisher, Paul Thalos

Ars Comb., 2002

2001

Domination Graphs with Nontrivial Components.

David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid

Graphs Comb., 2001

Two families of graphs that are not CCE-orientable.

David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam

Ars Comb., 2001

1998

The domination and competition graphs of a tournament.

David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid

J. Graph Theory, 1998

Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs.

David C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer

Discret. Appl. Math., 1998

1997

The Number of Dependent Arcs in an Acyclic Orientation.

David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley, Douglas B. West

J. Comb. Theory, Ser. B, 1997

P3-Connected Graphs of Minimum Size.

David C. Fisher, Kathryn Fraughnaugh, Larry J. Langley

Ars Comb., 1997

1996

Squaring a tournament: A proof of Dean's conjecture.

David C. Fisher

J. Graph Theory, 1996

1995

Tournament games and positive tournaments.

David C. Fisher, Jennifer Ryan

J. Graph Theory, 1995

Fractional colorings with large denominators.

David C. Fisher

J. Graph Theory, 1995

Size in maximal triangle-free graphs and minimal graphs of diameter 2.

Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary

Discret. Math., 1995

Probabilities Within optimal Strategies for Tournament Games.

David C. Fisher, Jennifer Ryan

Discret. Appl. Math., 1995

1994

Domination, Fractional Domination, 2-Packing, and Graph Products.

David C. Fisher

SIAM J. Discret. Math., 1994

Fractional domination of strong direct products.

David C. Fisher, Jennifer Ryan, Gayla S. Domke, Aniket Majumdar

Discret. Appl. Math., 1994

1992

Bounds on the largest root of the matching polynomial.

David C. Fisher, Jennifer Ryan

Discret. Math., 1992

Bounds on the number of complete subgraphs.

David C. Fisher, Jennifer Ryan

Discret. Math., 1992

1990

Dependence polynomials.

David C. Fisher, Anita E. Solow

Discret. Math., 1990

1989

Lower bounds on the number of triangles in a graph.

David C. Fisher

J. Graph Theory, 1989

1988

Your Favorite Parallel Algorithms Might Not Be as Fast as You Think.

David C. Fisher

IEEE Trans. Computers, 1988

The number of triangles in a K₄-free graph.

David C. Fisher

Discret. Math., 1988

1987

Communication Complexity of Matrix Multiplication-Abstract.

David C. Fisher

Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987