Paul A. Catlin

According to our database, Paul A. Catlin authored at least 25 papers between 1974 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2009

Edge-connectivity and edge-disjoint spanning trees.

Paul A. Catlin, Hong-Jian Lai, Yehong Shao

Discret. Math., 2009

2001

Graph family operations.

Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai

Discret. Math., 2001

1996

A reduction criterion for supereulerian graphs.

Paul A. Catlin

J. Graph Theory, 1996

Supereulerian Graphs and the Petersen Graph.

Paul A. Catlin, Hong-Jian Lai

J. Comb. Theory, Ser. B, 1996

Graphs without spanning closed trails.

Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai

Discret. Math., 1996

The reduction of graph families closed under contraction.

Paul A. Catlin

Discret. Math., 1996

1995

Vertex arboricity and maximum degree.

Paul A. Catlin, Hong-Jian Lai

Discret. Math., 1995

1992

Supereulerian graphs: A survey.

Paul A. Catlin

J. Graph Theory, 1992

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

1990

Hamilton cycles and closed trails in iterated line graphs.

Paul A. Catlin, Iqbalunnisa T. N. Janakiraman, N. Srinivasan

J. Graph Theory, 1990

1989

Double cycle covers and the petersen graph.

Paul A. Catlin

J. Graph Theory, 1989

Spanning eulerian subgraphs and matchings.

Paul A. Catlin

Discret. Math., 1989

1988

A reduction method to find spanning Eulerian subgraphs.

Paul A. Catlin

J. Graph Theory, 1988

Graph homomorphisms into the five-cycle.

Paul A. Catlin

J. Comb. Theory, Ser. B, 1988

Contractions of graphs with no spanning eulerian subgraphs.

Paul A. Catlin

Comb., 1988

1987

Spanning trails.

Paul A. Catlin

J. Graph Theory, 1987

1981

Topological cliques of random graphs.

Béla Bollobás, Paul A. Catlin

J. Comb. Theory, Ser. B, 1981

1980

Hadwiger's Conjecture is True for Almost Every Graph.

Béla Bollobás, Paul A. Catlin, Paul Erdös

Eur. J. Comb., 1980

1979

Hajós' graph-coloring conjecture: Variations and counterexamples.

Paul A. Catlin

J. Comb. Theory, Ser. B, 1979

Brooks' graph-coloring theorem and the independence number.

Paul A. Catlin

J. Comb. Theory, Ser. B, 1979

Subgraphs with triangular components.

Paul A. Catlin

Discret. Math., 1979

1978

Graph Decompositions Satisfying Extremal Degree Constraints.

Paul A. Catlin

J. Graph Theory, 1978

A bound on the chromatic number of a graph.

Paul A. Catlin

Discret. Math., 1978

Another bound on the chromatic number of a graph.

Paul A. Catlin

Discret. Math., 1978

1974

Subgraphs of graphs, I.

Paul A. Catlin

Discret. Math., 1974