Charles M. Grinstead

According to our database, Charles M. Grinstead authored at least 7 papers between 1981 and 1997.

Collaborative distances:

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

1997

On Medians of Lattice Distributions and a Game with Two Dice.

Charles M. Grinstead

Comb. Probab. Comput., 1997

1990

On the queen domination problem.

Charles M. Grinstead, Bruce Hahne, David Van Stone

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

On circular critical graphs.

Charles M. Grinstead

Discret. Math., 1984

1983

A survey of bounds for classical Ramsey numbers.

F. R. K. Chung, Charles M. Grinstead

J. Graph Theory, 1983

Efficient Graph Automorphism by Vertex Partitioning.

Glenn S. Fowler, Robert M. Haralick, F. Gail Gray, Charles Feustel, Charles M. Grinstead

Artif. Intell., 1983

1981

The strong perfect graph conjecture for toroifal graphs.

Charles M. Grinstead

J. Comb. Theory B, 1981