Paul A. Catlin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2009

Edge-connectivity and edge-disjoint spanning treesPaul A. Catlin, Hong-Jian Lai, Yehong Shao. DM, 309(5):1033-1040, 2009. [doi]

2001

Graph family operationsPaul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai. DM, 230(1-3):71-97, 2001. [doi]

1996

The reduction of graph families closed under contractionPaul A. Catlin. DM, 160(1-3):67-80, 1996. [doi]

A reduction criterion for supereulerian graphsPaul A. Catlin. jgt, 22(2):151-153, 1996. [doi]

Supereulerian Graphs and the Petersen GraphPaul A. Catlin, Hong-Jian Lai. JCT, 66(1):123-139, 1996. [doi]

Graphs without spanning closed trailsPaul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai. DM, 160(1-3):81-91, 1996. [doi]

1995

Vertex arboricity and maximum degreePaul A. Catlin, Hong-Jian Lai. DM, 141(1-3):37-46, 1995. [doi]

1992

Supereulerian graphs: A surveyPaul A. Catlin. jgt, 16(2):177-196, 1992. [doi]

Fractional Arboricity, Strength, and Principal Partitions in Graphs and MatroidsPaul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai. DAM, 40(3):285-302, 1992.

1990

Hamilton cycles and closed trails in iterated line graphsPaul A. Catlin, Iqbalunnisa T. N. Janakiraman, N. Srinivasan. jgt, 14(3):347-364, 1990. [doi]

1989

Spanning eulerian subgraphs and matchingsPaul A. Catlin. DM, 76(2):95-116, 1989. [doi]

Double cycle covers and the petersen graphPaul A. Catlin. jgt, 13(4):465-483, 1989. [doi]

1988

Contractions of graphs with no spanning eulerian subgraphsPaul A. Catlin. combinatorica, 8(4):313-321, 1988.

Graph homomorphisms into the five-cyclePaul A. Catlin. JCT, 45(2):199-211, 1988. [doi]

A reduction method to find spanning Eulerian subgraphsPaul A. Catlin. jgt, 12(1):29-44, 1988. [doi]

1987

Spanning trailsPaul A. Catlin. jgt, 11(2):161-167, 1987. [doi]

1981

Topological cliques of random graphsBéla Bollobás, Paul A. Catlin. JCT, 30(2):224-227, 1981. [doi]

1980

Hadwiger's Conjecture is True for Almost Every GraphBéla Bollobás, Paul A. Catlin, Paul Erdös. ejc, 1(3):195-199, 1980. [doi]

1979

Brooks graph-coloring theorem and the independence numberPaul A. Catlin. JCT, 27(1):42-48, 1979. [doi]

Hajós graph-coloring conjecture: Variations and counterexamplesPaul A. Catlin. JCT, 26(2):268-274, 1979. [doi]

Subgraphs with triangular componentsPaul A. Catlin. DM, 27(2):149-170, 1979. [doi]

1978

Graph Decompositions Satisfying Extremal Degree ConstraintsPaul A. Catlin. jgt, 2(2):165-170, 1978. [doi]

Another bound on the chromatic number of a graphPaul A. Catlin. DM, 24(1):1-6, 1978. [doi]

A bound on the chromatic number of a graphPaul A. Catlin. DM, 22(1):81-83, 1978. [doi]

1974

Subgraphs of graphs, IPaul A. Catlin. DM, 10(2):225-233, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL