David C. Fisher - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2003

Domination Graphs of Tournaments with Isolated VerticesDavid C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid. arscom, 66, 2003.

On the n x n Knight Cover ProblemDavid C. Fisher. arscom, 69, 2003.

2002

The Domination Number of Cubic Graphs with Girth at least FiveDavid C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager. endm, 11:751-759, 2002. [doi]

Fractional dominations and fractional total dominations of graph complementsDavid C. Fisher. DAM, 122(1-3):283-291, 2002.

Bishop Covers of Rectangular BoardsDavid C. Fisher, Paul Thalos. arscom, 65, 2002.

2001

Domination Graphs with Nontrivial ComponentsDavid C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid. gc, 17(2):227-236, 2001. [doi]

Two families of graphs that are not CCE-orientableDavid C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam. arscom, 58, 2001.

1998

Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski s GraphsDavid C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer. DAM, 84(1-3):93-105, 1998. [doi]

The domination and competition graphs of a tournamentDavid C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid. jgt, 29(2):103-110, 1998. [doi]

1997

P3-Connected Graphs of Minimum SizeDavid C. Fisher, Kathryn Fraughnaugh, Larry J. Langley. arscom, 47, 1997.

The Number of Dependent Arcs in an Acyclic OrientationDavid C. Fisher, Kathryn Fraughnaugh, Larry J. Langley, Douglas B. West. JCT, 71(1):73-78, 1997. [doi]

1996

Squaring a tournament: A proof of Dean's conjectureDavid C. Fisher. jgt, 23(1):43-48, 1996. [doi]

1995

Size in maximal triangle-free graphs and minimal graphs of diameter 2Curtiss Barefoot, Karen Casey, David C. Fisher, Kathryn Fraughnaugh, Frank Harary. DM, 138(1-3):93-99, 1995. [doi]

Probabilities Within optimal Strategies for Tournament GamesDavid C. Fisher, Jennifer Ryan. DAM, 56(1):87-91, 1995. [doi]

Fractional colorings with large denominatorsDavid C. Fisher. jgt, 20(4):403-409, 1995. [doi]

Tournament games and positive tournamentsDavid C. Fisher, Jennifer Ryan. jgt, 19(2):217-236, 1995. [doi]

1994

Fractional domination of strong direct productsDavid C. Fisher, Jennifer Ryan, Gayla S. Domke, Aniket Majumdar. DAM, 50(1):89-91, 1994.

Domination, Fractional Domination, 2-Packing, and Graph ProductsDavid C. Fisher. siamdm, 7(3):493-498, 1994. [doi]

1992

Bounds on the number of complete subgraphsDavid C. Fisher, Jennifer Ryan. DM, 103(3):313-320, 1992. [doi]

Bounds on the largest root of the matching polynomialDavid C. Fisher, Jennifer Ryan. DM, 110(1-3):275-278, 1992. [doi]

1990

Dependence polynomialsDavid C. Fisher, Anita E. Solow. DM, 82(3):251-258, 1990. [doi]

1989

Lower bounds on the number of triangles in a graphDavid C. Fisher. jgt, 13(4):505-512, 1989. [doi]

1988

Your Favorite Parallel Algorithms Might Not Be as Fast as You ThinkDavid C. Fisher. TC, 37(2):211-213, 1988.

The number of triangles in a K::4::-free graphDavid C. Fisher. DM, 69(2):203-205, 1988. [doi]

1987

Communication Complexity of Matrix Multiplication-AbstractDavid C. Fisher. ppsc 1989: 50

Sign in or sign up to see more results.

runs on WebDSL