| 2001 |
|---|
| 12 | EE | Paul A. Catlin,
Arthur M. Hobbs,
Hong-Jian Lai:
Graph family operations.
Discrete Mathematics 230(1-3): 71-97 (2001) |
| 1996 |
|---|
| 11 | EE | Paul A. Catlin:
The reduction of graph families closed under contraction.
Discrete Mathematics 160(1-3): 67-80 (1996) |
| 10 | EE | Paul A. Catlin,
Zheng-Yiao Han,
Hong-Jian Lai:
Graphs without spanning closed trails.
Discrete Mathematics 160(1-3): 81-91 (1996) |
| 9 | EE | Paul A. Catlin,
Hong-Jian Lai:
Supereulerian Graphs and the Petersen Graph.
J. Comb. Theory, Ser. B 66(1): 123-139 (1996) |
| 1995 |
|---|
| 8 | EE | Paul A. Catlin,
Hong-Jian Lai:
Vertex arboricity and maximum degree.
Discrete Mathematics 141(1-3): 37-46 (1995) |
| 1992 |
|---|
| 7 | | 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) |
| 1989 |
|---|
| 6 | EE | Paul A. Catlin:
Spanning eulerian subgraphs and matchings.
Discrete Mathematics 76(2): 95-116 (1989) |
| 1988 |
|---|
| 5 | | Paul A. Catlin:
Contractions of graphs with no spanning eulerian subgraphs.
Combinatorica 8(4): 313-321 (1988) |
| 4 | EE | Paul A. Catlin:
Graph homomorphisms into the five-cycle.
J. Comb. Theory, Ser. B 45(2): 199-211 (1988) |
| 1981 |
|---|
| 3 | EE | Béla Bollobás,
Paul A. Catlin:
Topological cliques of random graphs.
J. Comb. Theory, Ser. B 30(2): 224-227 (1981) |
| 1979 |
|---|
| 2 | EE | Paul A. Catlin:
Hajós' graph-coloring conjecture: Variations and counterexamples.
J. Comb. Theory, Ser. B 26(2): 268-274 (1979) |
| 1 | EE | Paul A. Catlin:
Brooks' graph-coloring theorem and the independence number.
J. Comb. Theory, Ser. B 27(1): 42-48 (1979) |
