Letter to the Editor - Remarks on Network Simplification. - Arthur M. Hobbs (Oper. Res., 1967)

The entire graph of a bridgeless connected plane graph is hamiltonian. - Arthur M. Hobbs; John Mitchem (Discret. Math., 1976)

Hamiltonian cycles in regular graphs of moderate degree. - Paul Erdös; Arthur M. Hobbs (J. Comb. Theory B, 1977)

A class of Hamiltonian regular graphs. - Paul Erdös; Arthur M. Hobbs (J. Graph Theory, 1978)

Maximal Hamiltonian cycles in squares of graphs. - Arthur M. Hobbs (J. Comb. Theory B, 1979)

Hamiltonian squares of cacti. - Arthur M. Hobbs (J. Comb. Theory B, 1979)

Disjoint cliques and disjoint maximal independent sets of vertices in graphs. - Paul Erdös; Arthur M. Hobbs; C. Payan (Discret. Math., 1982)

On the maximum number of independent edges in cubic graphs. - Arthur M. Hobbs; Edward F. Schmeichel (Discret. Math., 1982)

Packing Sequences. - Arthur M. Hobbs (J. Comb. Theory A, 1984)

Packing trees in complete graphs. - Arthur M. Hobbs; Brian A. Bourgeois; Jothi Kasiraj (Discret. Math., 1987)

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

Graph family operations. - Paul A. Catlin; Arthur M. Hobbs; Hong-Jian Lai (Discret. Math., 2001)

Dedication. - Arthur M. Hobbs; Hong-Jian Lai (Discret. Math., 2001)

Paul Catlin 1948-1995. - Arthur M. Hobbs; Hong-Jian Lai; Neil Robertson 001 (Discret. Math., 2001)

Transforming a graph into a 1-balanced graph. - Lavanya Kannan; Arthur M. Hobbs; Hong-Jian Lai; Hongyuan Lai (Discret. Appl. Math., 2009)

Hamiltonicity in vertex envelopes of plane cubic graphs. - Herbert Fleischner; Arthur M. Hobbs; Michael Tapfuma Muzheve (Discret. Math., 2009)

Balanced and 1-balanced graph constructions. - Arthur M. Hobbs; Lavanya Kannan; Hong-Jian Lai; Hongyuan Lai; Guoqing Weng (Discret. Appl. Math., 2010)