Paul A. Catlin

Publication Activity (10 Years)

Years Active: 1974-2009
Publications (10 Years): 0

Publications

Paul A. Catlin, Hong-Jian Lai, Yehong Shao
Edge-connectivity and edge-disjoint spanning trees. Discret. Math. 309 (5) (2009)
Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
Graph family operations. Discret. Math. 230 (1-3) (2001)
Paul A. Catlin
A reduction criterion for supereulerian graphs. J. Graph Theory 22 (2) (1996)
Paul A. Catlin, Hong-Jian Lai
Supereulerian Graphs and the Petersen Graph. J. Comb. Theory, Ser. B 66 (1) (1996)
Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai
Graphs without spanning closed trails. Discret. Math. 160 (1-3) (1996)
Paul A. Catlin
The reduction of graph families closed under contraction. Discret. Math. 160 (1-3) (1996)
Paul A. Catlin, Hong-Jian Lai
Vertex arboricity and maximum degree. Discret. Math. 141 (1-3) (1995)
Paul A. Catlin
Supereulerian graphs: A survey. J. Graph Theory 16 (2) (1992)
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)
Paul A. Catlin, Iqbalunnisa T. N. Janakiraman, N. Srinivasan
Hamilton cycles and closed trails in iterated line graphs. J. Graph Theory 14 (3) (1990)
Paul A. Catlin
Spanning eulerian subgraphs and matchings. Discret. Math. 76 (2) (1989)
Paul A. Catlin
Double cycle covers and the petersen graph. J. Graph Theory 13 (4) (1989)
Paul A. Catlin
Contractions of graphs with no spanning eulerian subgraphs. Comb. 8 (4) (1988)
Paul A. Catlin
Graph homomorphisms into the five-cycle. J. Comb. Theory, Ser. B 45 (2) (1988)
Paul A. Catlin
A reduction method to find spanning Eulerian subgraphs. J. Graph Theory 12 (1) (1988)
Paul A. Catlin
Spanning trails. J. Graph Theory 11 (2) (1987)
Béla Bollobás, Paul A. Catlin
Topological cliques of random graphs. J. Comb. Theory, Ser. B 30 (2) (1981)
Béla Bollobás, Paul A. Catlin, Paul Erdös
Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. 1 (3) (1980)
Paul A. Catlin
Brooks' graph-coloring theorem and the independence number. J. Comb. Theory, Ser. B 27 (1) (1979)
Paul A. Catlin
Hajós' graph-coloring conjecture: Variations and counterexamples. J. Comb. Theory, Ser. B 26 (2) (1979)
Paul A. Catlin
Subgraphs with triangular components. Discret. Math. 27 (2) (1979)
Paul A. Catlin
A bound on the chromatic number of a graph. Discret. Math. 22 (1) (1978)
Paul A. Catlin
Another bound on the chromatic number of a graph. Discret. Math. 24 (1) (1978)
Paul A. Catlin
Graph Decompositions Satisfying Extremal Degree Constraints. J. Graph Theory 2 (2) (1978)
Paul A. Catlin
Subgraphs of graphs, I. Discret. Math. 10 (2) (1974)