Graphs and Combinatorics

, Volume 27, Issue 2, pp 207–214 | Cite as

On 3-Edge-Connected Supereulerian Graphs

  • Hong-Jian Lai
  • Hao Li
  • Yehong Shao
  • Mingquan ZhanEmail author
Original Paper


The supereulerian graph problem, raised by Boesch et al. (J Graph Theory 1:79–84, 1977), asks when a graph has a spanning eulerian subgraph. Pulleyblank showed that such a decision problem, even when restricted to planar graphs, is NP-complete. Jaeger and Catlin independently showed that every 4-edge-connected graph has a spanning eulerian subgraph. In 1992, Zhan showed that every 3-edge-connected, essentially 7-edge-connected graph has a spanning eulerian subgraph. It was conjectured in 1995 that every 3-edge-connected, essentially 5-edge-connected graph has a spanning eulerian subgraph. In this paper, we show that if G is a 3-edge-connected, essentially 4-edge-connected graph and if for every pair of adjacent vertices u and v, d G (u) + d G (v) ≥ 9, then G has a spanning eulerian subgraph.


Supereulerian graphs Line graph 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boesch F.T., Suffel C., Tindell R.: The spanning subgraphs of eulerian graphs. J. Graph Theory 1, 79–84 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)Google Scholar
  3. 3.
    Catlin P.A.: A reduction method to find spanning eulerian subgraphs. J. Graph Theory 12, 29–45 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Catlin P.A.: Supereulerian graphs, a survey. J. Graph Theory 16, 177–196 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Catlin P.A., Han Z., Lai H.-J.: Graphs without spanning eulerian subgraphs. Discrete Math. 160, 81–91 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chen, Z.H., Lai, H.-J.: Reduction techniques for super-Eulerian graphs and related topics (a survey), Combinatorics and Graph Theory 95, vol. 1 (Hefei), pp. 53–69, World Sci. Publishing, River Edge (1995)Google Scholar
  7. 7.
    Jaeger F.: A note on subeulerian graphs. J. Graph Theory 3, 91–93 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Lai, H.-J.: Yehong Shao, Gexin Yu and Mingquan Zhan, Hamiltonian connectedness in 3-connected line graphs, Discret. Appl. Math. (accepted)Google Scholar
  9. 9.
    Pulleyblank W.R.: A note on graphs spanned by eulerian graphs. J. Graph Theory 3, 309–310 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Ryjác̆ek Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217–224 (1997)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Shao, Y.: Claw-free Graphs and Line Graphs, Ph. D. Dissertation, West Virginia University (2005)Google Scholar
  12. 12.
    Thomassen C.: Reflections on graph theory. J. Graph Theory 10, 309–324 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Zhan S.: On Hamiltonian line graphs and connectivity. Discret. Math. 89, 89–95 (1991)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer 2010

Authors and Affiliations

  • Hong-Jian Lai
    • 1
  • Hao Li
    • 1
  • Yehong Shao
    • 2
  • Mingquan Zhan
    • 3
    Email author
  1. 1.Department of MathematicsWest Virginia UniversityMorgantownUSA
  2. 2.Department of MathematicsOhio University Southern CampusIrontonUSA
  3. 3.Department of MathematicsMillersville UniversityMillersvilleUSA

Personalised recommendations