default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert L. Hemminger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1997
[j17]Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Derek A. Holton:
Cycles in quasi 4-connected graphs. Australas. J Comb. 15: 37-46 (1997)- [j16]Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen:
P3-isomorphisms for graphs. J. Graph Theory 26(1): 35-51 (1997) - 1996
- [j15]Robert E. L. Aldred, Chen Jian, Robert L. Hemminger:
The 3-connected graphs with a longest path containing precisely two contractible edges. Australas. J Comb. 13: 3-14 (1996) - 1995
- [j14]Robert E. L. Aldred, Robert L. Hemminger:
On Hamilton cycles and contractible edges in 3-connected graphs. Australas. J Comb. 11: 3-24 (1995) - 1994
- [j13]Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson:
Contractible edges in longest cycles in non-Hamiltonian graphs. Discret. Math. 133(1-3): 89-98 (1994) - 1993
- [j12]Robert L. Hemminger, Xingxing Yu:
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three. J. Graph Theory 17(2): 247-252 (1993) - [j11]Robert E. L. Aldred, Robert L. Hemminger, Katsuhiro Ota:
The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17(3): 361-371 (1993) - 1992
- [j10]Robert E. L. Aldred, Robert L. Hemminger, Xingxing Yu:
Maximum matchings in 3-connected graphs contain contractible edges. Australas. J Comb. 6: 23-34 (1992) - [j9]Robert L. Hemminger, Xingxing Yu:
On 3-connected graphs with contractible edge covers of size k. Discret. Math. 101(1-3): 115-133 (1992) - 1989
- [j8]Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota:
Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13(1): 17-21 (1989) - 1985
- [j7]Robert L. Hemminger, Brendan D. McKay:
Integer sequences with proscribed differences and bounded growth rate. Discret. Math. 55(3): 255-265 (1985) - 1982
- [j6]Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans:
On 3-skein isomorphisms of graphs. Comb. 2(4): 373-376 (1982) - [j5]Robert L. Hemminger, Heinz Adolf Jung:
On n-skein isomorphisms of graphs. J. Comb. Theory B 32(2): 103-111 (1982) - 1977
- [j4]J. Adrian Bondy, Robert L. Hemminger:
Graph reconstruction - a survey. J. Graph Theory 1(3): 227-268 (1977) - [j3]Robert L. Hemminger, Joseph B. Klerlein:
Line pseudodigraphs. J. Graph Theory 1(4): 365-377 (1977) - 1976
- [j2]Lowell W. Beineke, Robert L. Hemminger:
Infinite digraphs isomorphic with their line digraphs. J. Comb. Theory B 21(3): 245-256 (1976) - 1972
- [j1]D. L. Greenwell, Robert L. Hemminger:
Forbidden subgraphs for graphs with planar line graphs. Discret. Math. 2(1): 31-34 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
