| 2009 |
| 12 | EE | Lavanya Kannan,
Arthur M. Hobbs,
Hong-Jian Lai,
Hongyuan Lai:
Transforming a graph into a 1-balanced graph.
Discrete Applied Mathematics 157(2): 300-308 (2009) |
| 2001 |
| 11 | EE | Arthur M. Hobbs,
Hong-Jian Lai:
Dedication.
Discrete Mathematics 230(1-3): 1- (2001) |
| 10 | EE | Arthur M. Hobbs,
Hong-Jian Lai,
Neil Robertson:
Paul Catlin 1948-1995.
Discrete Mathematics 230(1-3): 3-12 (2001) |
| 9 | EE | Paul A. Catlin,
Arthur M. Hobbs,
Hong-Jian Lai:
Graph family operations.
Discrete Mathematics 230(1-3): 71-97 (2001) |
| 1992 |
| 8 | | Paul A. Catlin,
Jerrold W. Grossman,
Arthur M. Hobbs,
Hong-Jian Lai:
Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discrete Applied Mathematics 40(3): 285-302 (1992) |
| 1987 |
| 7 | EE | Arthur M. Hobbs,
Brian A. Bourgeois,
Jothi Kasiraj:
Packing trees in complete graphs.
Discrete Mathematics 67(1): 27-42 (1987) |
| 1984 |
| 6 | | Arthur M. Hobbs:
Packing Sequences.
J. Comb. Theory, Ser. A 36(2): 174-182 (1984) |
| 1982 |
| 5 | EE | Paul Erdös,
Arthur M. Hobbs,
C. Payan:
Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
Discrete Mathematics 42(1): 57-61 (1982) |
| 4 | EE | Arthur M. Hobbs,
Edward F. Schmeichel:
On the maximum number of independent edges in cubic graphs.
Discrete Mathematics 42(2-3): 317-320 (1982) |
| 1979 |
| 3 | EE | Arthur M. Hobbs:
Maximal Hamiltonian cycles in squares of graphs.
J. Comb. Theory, Ser. B 26(1): 35-49 (1979) |
| 2 | EE | Arthur M. Hobbs:
Hamiltonian squares of cacti.
J. Comb. Theory, Ser. B 26(1): 50-65 (1979) |
| 1977 |
| 1 | EE | Paul Erdös,
Arthur M. Hobbs:
Hamiltonian cycles in regular graphs of moderate degree.
J. Comb. Theory, Ser. B 23(1): 139-142 (1977) |