Arthur M. Hobbs

17 papers Journal 17
YearRankTypeTitle / Venue / Authors
2010 J jnl
Balanced and 1-balanced graph constructions.
Discret. Appl. Math.
Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng
2009 J jnl
Hamiltonicity in vertex envelopes of plane cubic graphs.
Discret. Math.
Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve
2009 J jnl
Transforming a graph into a 1-balanced graph.
Discret. Appl. Math.
Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai
2001 J jnl
Dedication.
Discret. Math.
Arthur M. Hobbs, Hong-Jian Lai
2001 J jnl
Graph family operations.
Discret. Math.
Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
2001 J jnl
Paul Catlin 1948-1995.
Discret. Math.
Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
1992 J jnl
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discret. Appl. Math.
Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai
1987 J jnl
Packing trees in complete graphs.
Discret. Math.
Arthur M. Hobbs, Brian A. Bourgeois, Jothi Kasiraj
1984 J jnl
Packing Sequences.
J. Comb. Theory A
Arthur M. Hobbs
1982 J jnl
Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
Discret. Math.
Paul Erdös, Arthur M. Hobbs, C. Payan
1982 J jnl
On the maximum number of independent edges in cubic graphs.
Discret. Math.
Arthur M. Hobbs, Edward F. Schmeichel
1979 J jnl
Hamiltonian squares of cacti.
J. Comb. Theory B
Arthur M. Hobbs
1979 J jnl
Maximal Hamiltonian cycles in squares of graphs.
J. Comb. Theory B
Arthur M. Hobbs
1978 J jnl
A class of Hamiltonian regular graphs.
J. Graph Theory
Paul Erdös, Arthur M. Hobbs
1977 J jnl
Hamiltonian cycles in regular graphs of moderate degree.
J. Comb. Theory B
Paul Erdös, Arthur M. Hobbs
1976 J jnl
The entire graph of a bridgeless connected plane graph is hamiltonian.
Discret. Math.
Arthur M. Hobbs, John Mitchem
1967 J jnl
Letter to the Editor - Remarks on Network Simplification.
Oper. Res.
Arthur M. Hobbs