Forbidden subgraphs for graphs with planar line graphs. - D. L. Greenwell; Robert L. Hemminger (Discret. Math., 1972)

Infinite digraphs isomorphic with their line digraphs. - Lowell W. Beineke; Robert L. Hemminger (J. Comb. Theory B, 1976)

Graph reconstruction - a survey. - J. Adrian Bondy; Robert L. Hemminger (J. Graph Theory, 1977)

Line pseudodigraphs. - Robert L. Hemminger; Joseph B. Klerlein (J. Graph Theory, 1977)

On 3-skein isomorphisms of graphs. - Robert L. Hemminger; Heinz Adolf Jung; Alexander K. Kelmans (Comb., 1982)

On n-skein isomorphisms of graphs. - Robert L. Hemminger; Heinz Adolf Jung (J. Comb. Theory B, 1982)

Integer sequences with proscribed differences and bounded growth rate. - Robert L. Hemminger; Brendan D. McKay (Discret. Math., 1985)

Longest cycles in 3-connected graphs contain three contractible edges. - Nathaniel Dean; Robert L. Hemminger; Katsuhiro Ota (J. Graph Theory, 1989)

Maximum matchings in 3-connected graphs contain contractible edges. - Robert E. L. Aldred; Robert L. Hemminger; Xingxing Yu (Australas. J Comb., 1992)

On 3-connected graphs with contractible edge covers of size k. - Robert L. Hemminger; Xingxing Yu (Discret. Math., 1992)

The 3-connected graphs having a longest cycle containing only three contractible edges. - Robert E. L. Aldred; Robert L. Hemminger; Katsuhiro Ota (J. Graph Theory, 1993)

Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three. - Robert L. Hemminger; Xingxing Yu (J. Graph Theory, 1993)

Contractible edges in longest cycles in non-Hamiltonian graphs. - Mark N. Ellingham; Robert L. Hemminger; Kathryn E. Johnson (Discret. Math., 1994)

On Hamilton cycles and contractible edges in 3-connected graphs. - Robert E. L. Aldred; Robert L. Hemminger (Australas. J Comb., 1995)

The 3-connected graphs with a longest path containing precisely two contractible edges. - Robert E. L. Aldred; Chen Jian; Robert L. Hemminger (Australas. J Comb., 1996)

Cycles in quasi 4-connected graphs. - Robert E. L. Aldred; Mark N. Ellingham; Robert L. Hemminger; Derek A. Holton (Australas. J Comb., 1997)

P3-isomorphisms for graphs. - Robert E. L. Aldred; Mark N. Ellingham; Robert L. Hemminger; Peter Jipsen (J. Graph Theory, 1997)