On 3-Edge-Connected Supereulerian Graphs
- 157 Downloads
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.
KeywordsSupereulerian graphs Line graph
Unable to display preview. Download preview PDF.
- 2.Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)Google Scholar
- 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
- 8.Lai, H.-J.: Yehong Shao, Gexin Yu and Mingquan Zhan, Hamiltonian connectedness in 3-connected line graphs, Discret. Appl. Math. (accepted)Google Scholar
- 11.Shao, Y.: Claw-free Graphs and Line Graphs, Ph. D. Dissertation, West Virginia University (2005)Google Scholar