John S. Maybee

According to our database, John S. Maybee authored at least 9 papers between 1980 and 2001.

Collaborative distances:

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

2001

Deterministic inverse zero-patterns.

Charles R. Johnson, Michael Lundquist, Thomas J. Lundy, John S. Maybee

Discret. Appl. Math., 2001

1995

Competition Graphs of Strongly Connected and Hamiltonian Digraphs.

Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman

SIAM J. Discret. Math., 1995

1993

Interval competition graphs of symmetric diagraphs.

J. Richard Lundgren, Craig W. Rasmussen, John S. Maybee

Discret. Math., 1993

1991

Pearls in Graph Theory: A Comprehensive Introduction (N. Hartsfield and G. Ringel).

John S. Maybee

SIAM Rev., 1991

1990

Qualitative Analysis of Schur Complements.

Charles R. Johnson, John S. Maybee

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1985

On signed digraphs with all cycles negative.

Frank Harary, J. Richard Lundgren, John S. Maybee

Discret. Appl. Math., 1985

1984

Inverting graphs of rectangular matrices.

Harvey J. Greenberg, J. Richard Lundgren, John S. Maybee

Discret. Appl. Math., 1984

1983

A characterization of graphs of competition number m.

J. Richard Lundgren, John S. Maybee

Discret. Appl. Math., 1983

1980

Sign solvable graphs.

John S. Maybee

Discret. Appl. Math., 1980