David R. Guichard

According to our database, David R. Guichard authored at least 12 papers between 1983 and 2008.

Collaborative distances:

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

2008

Perfect matchings in pruned grid graphs.

David R. Guichard

Discret. Math., 2008

2004

Redundance of Trees.

David R. Guichard

Ars Comb., 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

2001

Domination Graphs with Nontrivial Components.

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

Graphs Comb., 2001

1998

Competition Graphs of Hamiltonian Digraphs.

David R. Guichard

SIAM J. Discret. Math., 1998

1996

No-hole K-tuple (r+1)-distant Colorings of odd Cycles.

David R. Guichard

Discret. Appl. Math., 1996

1993

Acyclic graph coloring and the complexity of the star chromatic number.

David R. Guichard

J. Graph Theory, 1993

1992

Pair Labelings of Graphs.

David R. Guichard, John W. Krussel

SIAM J. Discret. Math., 1992

1990

Two theorems on the addition of residue classes.

David R. Guichard

Discret. Math., 1990

1988

The number of maximal independent sets in a connected graph.

Jerrold R. Griggs, Charles M. Grinstead, David R. Guichard

Discret. Math., 1988

1984

A note on r-maximal subspaces of V_∞.

David R. Guichard

Ann. Pure Appl. Log., 1984

1983

Automorphisms of substructure lattices in recursive algebra.

David R. Guichard

Ann. Pure Appl. Log., 1983