default search action
Arthur M. Hobbs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j17]Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng:
Balanced and 1-balanced graph constructions. Discret. Appl. Math. 158(14): 1511-1523 (2010)
2000 – 2009
- 2009
- [j16]Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai:
Transforming a graph into a 1-balanced graph. Discret. Appl. Math. 157(2): 300-308 (2009) - [j15]Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve:
Hamiltonicity in vertex envelopes of plane cubic graphs. Discret. Math. 309(14): 4793-4809 (2009) - 2001
- [j14]Arthur M. Hobbs, Hong-Jian Lai:
Dedication. Discret. Math. 230(1-3): 1- (2001) - [j13]Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson:
Paul Catlin 1948-1995. Discret. Math. 230(1-3): 3-12 (2001) - [j12]Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai:
Graph family operations. Discret. Math. 230(1-3): 71-97 (2001)
1990 – 1999
- 1992
- [j11]Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai:
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. Discret. Appl. Math. 40(3): 285-302 (1992)
1980 – 1989
- 1987
- [j10]Arthur M. Hobbs, Brian A. Bourgeois, Jothi Kasiraj:
Packing trees in complete graphs. Discret. Math. 67(1): 27-42 (1987) - 1984
- [j9]Arthur M. Hobbs:
Packing Sequences. J. Comb. Theory A 36(2): 174-182 (1984) - 1982
- [j8]Paul Erdös, Arthur M. Hobbs, C. Payan:
Disjoint cliques and disjoint maximal independent sets of vertices in graphs. Discret. Math. 42(1): 57-61 (1982) - [j7]Arthur M. Hobbs, Edward F. Schmeichel:
On the maximum number of independent edges in cubic graphs. Discret. Math. 42(2-3): 317-320 (1982)
1970 – 1979
- 1979
- [j6]Arthur M. Hobbs:
Maximal Hamiltonian cycles in squares of graphs. J. Comb. Theory B 26(1): 35-49 (1979) - [j5]Arthur M. Hobbs:
Hamiltonian squares of cacti. J. Comb. Theory B 26(1): 50-65 (1979) - 1978
- [j4]Paul Erdös, Arthur M. Hobbs:
A class of Hamiltonian regular graphs. J. Graph Theory 2(2): 129-135 (1978) - 1977
- [j3]Paul Erdös, Arthur M. Hobbs:
Hamiltonian cycles in regular graphs of moderate degree. J. Comb. Theory B 23(1): 139-142 (1977) - 1976
- [j2]Arthur M. Hobbs, John Mitchem:
The entire graph of a bridgeless connected plane graph is hamiltonian. Discret. Math. 16(3): 233-239 (1976)
1960 – 1969
- 1967
- [j1]Arthur M. Hobbs:
Letter to the Editor - Remarks on Network Simplification. Oper. Res. 15(3): 548-551 (1967)
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 2024-06-10 21:22 CEST 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: