Arthur M. Hobbs

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2010
Balanced and 1-balanced graph constructions.
Discrete Applied Mathematics, 2010

2009
Hamiltonicity in vertex envelopes of plane cubic graphs.
Discrete Mathematics, 2009

Transforming a graph into a 1-balanced graph.
Discrete Applied Mathematics, 2009

2001
Paul Catlin 1948-1995.
Discrete Mathematics, 2001

Dedication.
Discrete Mathematics, 2001

Graph family operations.
Discrete Mathematics, 2001

1992
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discrete Applied Mathematics, 1992

1987
Packing trees in complete graphs.
Discrete Mathematics, 1987

1984
Packing Sequences.
J. Comb. Theory, Ser. A, 1984

1982
On the maximum number of independent edges in cubic graphs.
Discrete Mathematics, 1982

Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
Discrete Mathematics, 1982

1979
Hamiltonian squares of cacti.
J. Comb. Theory, Ser. B, 1979

Maximal Hamiltonian cycles in squares of graphs.
J. Comb. Theory, Ser. B, 1979

1978
A class of Hamiltonian regular graphs.
Journal of Graph Theory, 1978

1977
Hamiltonian cycles in regular graphs of moderate degree.
J. Comb. Theory, Ser. B, 1977

1976
The entire graph of a bridgeless connected plane graph is hamiltonian.
Discrete Mathematics, 1976

1967
Letter to the Editor - Remarks on Network Simplification.
Operations Research, 1967


  Loading...