Norman J. Pullman

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1999
Linear operators that strongly preserve graphical properties of matrices - II.
Discret. Math., 1999

1996
The polytope of generalized tournament matrices with a common integral score vector.
Ars Comb., 1996

1995
Competition Graphs of Strongly Connected and Hamiltonian Digraphs.
SIAM J. Discret. Math., 1995

1992
Linear operators that strongly preserve graphical properties of matrices.
Discret. Math., 1992

1991
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices.
J. Comb. Theory B, 1991

1990
Regular graphs with prescribed chromatic number.
J. Graph Theory, 1990

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

1984
Clique Covering of Graphs IV. Algorithms.
SIAM J. Comput., 1984

1982
On a clique covering problem of orlin.
Discret. Math., 1982

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


  Loading...