#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1974

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Paul A. Catlin
- Journal of Graph Theory
- 1988

- Paul A. Catlin
- J. Comb. Theory, Ser. B
- 1979

- Béla Bollobás, Paul A. Catlin, Paul Erdös
- Eur. J. Comb.
- 1980

- Paul A. Catlin
- Journal of Graph Theory
- 1992

A graph is supereulerian if it has a spanning eulerian subgraph. There is a reduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval number of a graph. We outline the research on supereulerian graphs, the… (More)

- Paul A. Catlin
- Journal of Graph Theory
- 1989

Let O(G) denote the set of odd-degree vertices of a graph G. Let t E N and let 9, denote the family of graphs G whose edge set has a partition f ( G ) = E, U E2 U U 15,. such that O(G) = O(G[€,]) (1 5 i 5 t ) . This partition is associated with a double cycle cover of G. We show that if a graph G is at most 5 edges short of being 4-edge-connected, then… (More)

- Béla Bollobás, Paul A. Catlin
- J. Comb. Theory, Ser. B
- 1981

- Paul A. Catlin
- Discrete Mathematics
- 1974

- Paul A. Catlin
- Combinatorica
- 1988

- Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai
- Discrete Applied Mathematics
- 1992

- Paul A. Catlin
- Discrete Mathematics
- 1978