Paul A. Catlin

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Edge-connectivity and edge-disjoint spanning trees.
Discrete Mathematics, 2009

2001
Graph family operations.
Discrete Mathematics, 2001

1996
A reduction criterion for supereulerian graphs.
Journal of Graph Theory, 1996

Supereulerian Graphs and the Petersen Graph.
J. Comb. Theory, Ser. B, 1996

Graphs without spanning closed trails.
Discrete Mathematics, 1996

The reduction of graph families closed under contraction.
Discrete Mathematics, 1996

1995
Vertex arboricity and maximum degree.
Discrete Mathematics, 1995

1992
Supereulerian graphs: A survey.
Journal of Graph Theory, 1992

Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.
Discrete Applied Mathematics, 1992

1990
Hamilton cycles and closed trails in iterated line graphs.
Journal of Graph Theory, 1990

1989
Double cycle covers and the petersen graph.
Journal of Graph Theory, 1989

Spanning eulerian subgraphs and matchings.
Discrete Mathematics, 1989

1988
A reduction method to find spanning Eulerian subgraphs.
Journal of Graph Theory, 1988

Graph homomorphisms into the five-cycle.
J. Comb. Theory, Ser. B, 1988

Contractions of graphs with no spanning eulerian subgraphs.
Combinatorica, 1988

1987
Spanning trails.
Journal of Graph Theory, 1987

1981
Topological cliques of random graphs.
J. Comb. Theory, Ser. B, 1981

1980
Hadwiger's Conjecture is True for Almost Every Graph.
Eur. J. Comb., 1980

1979
Hajós' graph-coloring conjecture: Variations and counterexamples.
J. Comb. Theory, Ser. B, 1979

Brooks' graph-coloring theorem and the independence number.
J. Comb. Theory, Ser. B, 1979

Subgraphs with triangular components.
Discrete Mathematics, 1979

1978
Graph Decompositions Satisfying Extremal Degree Constraints.
Journal of Graph Theory, 1978

A bound on the chromatic number of a graph.
Discrete Mathematics, 1978

Another bound on the chromatic number of a graph.
Discrete Mathematics, 1978

1974
Subgraphs of graphs, I.
Discrete Mathematics, 1974


  Loading...