Paul A. Catlin

25 papers Journal 25

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Edge-connectivity and edge-disjoint spanning trees. Discret. Math. Paul A. Catlin, Hong-Jian Lai, Yehong Shao
2001	J	`jnl`	Graph family operations. Discret. Math. Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai
1996	J	`jnl`	A reduction criterion for supereulerian graphs. J. Graph Theory Paul A. Catlin
1996	J	`jnl`	Graphs without spanning closed trails. Discret. Math. Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai
1996	J	`jnl`	Supereulerian Graphs and the Petersen Graph. J. Comb. Theory B Paul A. Catlin, Hong-Jian Lai
1996	J	`jnl`	The reduction of graph families closed under contraction. Discret. Math. Paul A. Catlin
1995	J	`jnl`	Vertex arboricity and maximum degree. Discret. Math. Paul A. Catlin, Hong-Jian Lai
1992	J	`jnl`	Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. Discret. Appl. Math. Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai
1992	J	`jnl`	Supereulerian graphs: A survey. J. Graph Theory Paul A. Catlin
1990	J	`jnl`	Hamilton cycles and closed trails in iterated line graphs. J. Graph Theory Paul A. Catlin, Iqbalunnisa T. N. Janakiraman, N. Srinivasan
1989	J	`jnl`	Double cycle covers and the petersen graph. J. Graph Theory Paul A. Catlin
1989	J	`jnl`	Spanning eulerian subgraphs and matchings. Discret. Math. Paul A. Catlin
1988	J	`jnl`	A reduction method to find spanning Eulerian subgraphs. J. Graph Theory Paul A. Catlin
1988	J	`jnl`	Contractions of graphs with no spanning eulerian subgraphs. Comb. Paul A. Catlin
1988	J	`jnl`	Graph homomorphisms into the five-cycle. J. Comb. Theory B Paul A. Catlin
1987	J	`jnl`	Spanning trails. J. Graph Theory Paul A. Catlin
1981	J	`jnl`	Topological cliques of random graphs. J. Comb. Theory B Béla Bollobás, Paul A. Catlin
1980	J	`jnl`	Hadwiger's Conjecture is True for Almost Every Graph. Eur. J. Comb. Béla Bollobás, Paul A. Catlin, Paul Erdös
1979	J	`jnl`	Brooks' graph-coloring theorem and the independence number. J. Comb. Theory B Paul A. Catlin
1979	J	`jnl`	Hajós' graph-coloring conjecture: Variations and counterexamples. J. Comb. Theory B Paul A. Catlin
1979	J	`jnl`	Subgraphs with triangular components. Discret. Math. Paul A. Catlin
1978	J	`jnl`	A bound on the chromatic number of a graph. Discret. Math. Paul A. Catlin
1978	J	`jnl`	Another bound on the chromatic number of a graph. Discret. Math. Paul A. Catlin
1978	J	`jnl`	Graph Decompositions Satisfying Extremal Degree Constraints. J. Graph Theory Paul A. Catlin
1974	J	`jnl`	Subgraphs of graphs, I. Discret. Math. Paul A. Catlin