We stand with Ukraine  

Arthur M. Hobbs

According to our database1, Arthur M. Hobbs authored at least 17 papers between 1967 and 2010.

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

Timeline

1970
1975
1980
1985
1990
1995
2000
2005
2010
0
1
2
3
4
1
2
3
1
1
1
2
2
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Balanced and 1-balanced graph constructions.
[BibTeX]
[DOI]
Arthur M. Hobbs
,
Lavanya Kannan
,
Hong-Jian Lai
,
Hongyuan Lai
,
Guoqing Weng
Discret. Appl. Math., 2010

2009
Hamiltonicity in vertex envelopes of plane cubic graphs.
[BibTeX]
[DOI]
Herbert Fleischner
,
Arthur M. Hobbs
,
Michael Tapfuma Muzheve
Discret. Math., 2009

Transforming a graph into a 1-balanced graph.
[BibTeX]
[DOI]
Lavanya Kannan
,
Arthur M. Hobbs
,
Hong-Jian Lai
,
Hongyuan Lai
Discret. Appl. Math., 2009

2001
Paul Catlin 1948-1995.
[BibTeX]
[DOI]
Arthur M. Hobbs
,
Hong-Jian Lai
,
Neil Robertson
Discret. Math., 2001

Dedication.
[BibTeX]
[DOI]
Arthur M. Hobbs
,
Hong-Jian Lai
Discret. Math., 2001

Graph family operations.
[BibTeX]
[DOI]
Paul A. Catlin
,
Arthur M. Hobbs
,
Hong-Jian Lai
Discret. Math., 2001

1992
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
[BibTeX]
[DOI]
Paul A. Catlin
,
Jerrold W. Grossman
,
Arthur M. Hobbs
,
Hong-Jian Lai
Discret. Appl. Math., 1992

1987
Packing trees in complete graphs.
[BibTeX]
[DOI]
Arthur M. Hobbs
,
Brian A. Bourgeois
,
Jothi Kasiraj
Discret. Math., 1987

1984
Packing Sequences.
[BibTeX]
[DOI]
Arthur M. Hobbs
J. Comb. Theory A, 1984

1982
On the maximum number of independent edges in cubic graphs.
[BibTeX]
[DOI]
Arthur M. Hobbs
,
Edward F. Schmeichel
Discret. Math., 1982

Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
[BibTeX]
[DOI]
Paul Erdös
,
Arthur M. Hobbs
,
C. Payan
Discret. Math., 1982

1979
Hamiltonian squares of cacti.
[BibTeX]
[DOI]
Arthur M. Hobbs
J. Comb. Theory B, 1979

Maximal Hamiltonian cycles in squares of graphs.
[BibTeX]
[DOI]
Arthur M. Hobbs
J. Comb. Theory B, 1979

1978
A class of Hamiltonian regular graphs.
[BibTeX]
[DOI]
Paul Erdös
,
Arthur M. Hobbs
J. Graph Theory, 1978

1977
Hamiltonian cycles in regular graphs of moderate degree.
[BibTeX]
[DOI]
Paul Erdös
,
Arthur M. Hobbs
J. Comb. Theory B, 1977

1976
The entire graph of a bridgeless connected plane graph is hamiltonian.
[BibTeX]
[DOI]
Arthur M. Hobbs
,
John Mitchem
Discret. Math., 1976

1967
Letter to the Editor - Remarks on Network Simplification.
[BibTeX]
[DOI]
Arthur M. Hobbs
Oper. Res., 1967


  Loading...