Norman J. Pullman

According to our database, Norman J. Pullman authored at least 10 papers between 1968 and 1999.

Collaborative distances:

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

1999

Linear operators that strongly preserve graphical properties of matrices - II.

LeRoy B. Beasley, Sylvia D. Monson, Norman J. Pullman

Discret. Math., 1999

1996

The polytope of generalized tournament matrices with a common integral score vector.

Stephen J. Kirkland, Norman J. Pullman

Ars Comb., 1996

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

1992

Linear operators that strongly preserve graphical properties of matrices.

LeRoy B. Beasley, Norman J. Pullman

Discret. Math., 1992

1991

Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices.

David A. Gregory, Norman J. Pullman, Kathryn Fraughnaugh Jones, J. Richard Lundgren

J. Comb. Theory B, 1991

1990

Regular graphs with prescribed chromatic number.

Lou Caccetta, Norman J. Pullman

J. Graph Theory, 1990

1988

Transitions between network states may cause both equipotentiality and localization of function in cerebral cortex.

J. Zachary Jacobson, Norman J. Pullman, William C. Treurniet

Neural Networks, 1988

1984

Clique Covering of Graphs IV. Algorithms.

Norman J. Pullman

SIAM J. Comput., 1984

1982

On a clique covering problem of orlin.

David A. Gregory, Norman J. Pullman

Discret. Math., 1982

1968

Tournaments and handicaps.

Norman J. Pullman, John W. Moon

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968