Arthur M. Hobbs

Publication Activity (10 Years)

Years Active: 1967-2010
Publications (10 Years): 0

Publications

Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng
Balanced and 1-balanced graph constructions. Discret. Appl. Math. 158 (14) (2010)
Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai
Transforming a graph into a 1-balanced graph. Discret. Appl. Math. 157 (2) (2009)
Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve
Hamiltonicity in vertex envelopes of plane cubic graphs. Discret. Math. 309 (14) (2009)
Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
Paul Catlin 1948-1995. Discret. Math. 230 (1-3) (2001)
Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
Graph family operations. Discret. Math. 230 (1-3) (2001)
Arthur M. Hobbs, Hong-Jian Lai
Dedication. Discret. Math. 230 (1-3) (2001)
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) (1992)
Arthur M. Hobbs, Brian A. Bourgeois, Jothi Kasiraj
Packing trees in complete graphs. Discret. Math. 67 (1) (1987)
Arthur M. Hobbs
Packing Sequences. J. Comb. Theory, Ser. A 36 (2) (1984)
Arthur M. Hobbs, Edward F. Schmeichel
On the maximum number of independent edges in cubic graphs. Discret. Math. 42 (2-3) (1982)
Paul Erdös, Arthur M. Hobbs, C. Payan
Disjoint cliques and disjoint maximal independent sets of vertices in graphs. Discret. Math. 42 (1) (1982)
Arthur M. Hobbs
Maximal Hamiltonian cycles in squares of graphs. J. Comb. Theory, Ser. B 26 (1) (1979)
Arthur M. Hobbs
Hamiltonian squares of cacti. J. Comb. Theory, Ser. B 26 (1) (1979)
Paul Erdös, Arthur M. Hobbs
A class of Hamiltonian regular graphs. J. Graph Theory 2 (2) (1978)
Paul Erdös, Arthur M. Hobbs
Hamiltonian cycles in regular graphs of moderate degree. J. Comb. Theory, Ser. B 23 (1) (1977)
Arthur M. Hobbs, John Mitchem
The entire graph of a bridgeless connected plane graph is hamiltonian. Discret. Math. 16 (3) (1976)
Arthur M. Hobbs
Letter to the Editor - Remarks on Network Simplification. Oper. Res. 15 (3) (1967)