Robert L. Hemminger

According to our database1, Robert L. Hemminger authored at least 17 papers between 1972 and 1997.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1997
<i>P</i><sub>3</sub>-isomorphisms for graphs.
J. Graph Theory, 1997

Cycles in quasi 4-connected graphs.
Australas. J Comb., 1997

1996
The 3-connected graphs with a longest path containing precisely two contractible edges.
Australas. J Comb., 1996

1995
On Hamilton cycles and contractible edges in 3-connected graphs.
Australas. J Comb., 1995

1994
Contractible edges in longest cycles in non-Hamiltonian graphs.
Discret. Math., 1994

1993
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three.
J. Graph Theory, 1993

The 3-connected graphs having a longest cycle containing only three contractible edges.
J. Graph Theory, 1993

1992
On 3-connected graphs with contractible edge covers of size k.
Discret. Math., 1992

Maximum matchings in 3-connected graphs contain contractible edges.
Australas. J Comb., 1992

1989
Longest cycles in 3-connected graphs contain three contractible edges.
J. Graph Theory, 1989

1985
Integer sequences with proscribed differences and bounded growth rate.
Discret. Math., 1985

1982
On <i>n</i>-skein isomorphisms of graphs.
J. Comb. Theory B, 1982

On 3-skein isomorphisms of graphs.
Comb., 1982

1977
Line pseudodigraphs.
J. Graph Theory, 1977

Graph reconstruction - a survey.
J. Graph Theory, 1977

1976
Infinite digraphs isomorphic with their line digraphs.
J. Comb. Theory B, 1976

1972
Forbidden subgraphs for graphs with planar line graphs.
Discret. Math., 1972


  Loading...