Contractions of graphs with no spanning eulerian subgraphs


Letp≧2 be a fixed integer, and letG be a connected graph onn vertices. Ifδ(G)≧2, ifd(u)+d(v)>2n/p−2 holds wheneveruvE(G), and ifn is sufficiently large compared top, then eitherG has a spanning eulerian subgraph, orG is contractible to a graphG 1 of order less thenp and with no spanning eulerian subgraph. The casep=2 was proved by Lesniak-Foster and Williamson. The casep=5 was conjectured by Benhocine, Clark, Köhler, and Veldman, when they proved virtually the casep=3. The inequality is best-possible.

This is a preview of subscription content, access via your institution.


  1. [1]

    A.Benhocine, L.Clark, N.Köhler and H. J.Veldman, On circuits and pancyclic line graphs,Preprint, 1985.

  2. [2]

    P. A.Catlin, Removing forests to find spanning eulerian subgraphs,Preprint, 1985.

  3. [3]

    P. A.Catlin, Spanning eulerian subgraphs and matchings,Preprint.

  4. [4]

    F. Harary andC. St. J. A. Nash-Williams, On eulerian and hamiltonian graphs and line graphs,Canadian Math. Bull 8 (1965), 701–710.

    Google Scholar 

  5. [5]

    F. Jaeger, A note on subeulerian graphs,J. Graph Theory 3 (1979), 91–93.

    Google Scholar 

  6. [6]

    L. Lesniak-Foster andJ. E. Williamson, On spanning and dominating circuits in graphs,Canad. Math. Bull. 20 (1977), 215–220.

    Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Catlin, P.A. Contractions of graphs with no spanning eulerian subgraphs. Combinatorica 8, 313–321 (1988).

Download citation

AMS subject classification

  • 05 C 45