Chen, Zhi-Hong; Lai, Hong-Jian; Luo, Weiqi; Shao, Yehong Spanning Eulerian subgraphs in claw-free graphs. (English) Zbl 1124.05054 J. Comb. Math. Comb. Comput. 59, 165-171 (2006). A finite and loopless graph \(G\) is called claw-free if it does not contain an induced subgraph isomorphic to \(K_{1,3}\). \(G\) is essentially \(k\)-edge-connected if for any edge set \(X\) with \(| X| <k\) at most one component of \(G-X\) has edges. It is shown that every essentially \(4\)-edge-connected claw-free graph \(G\) has a spanning Eulerian subgraph with maximum degree at most \(4\). Reviewer: Reinhardt Euler (Brest) Cited in 1 ReviewCited in 1 Document MSC: 05C45 Eulerian and Hamiltonian graphs Keywords:claw-free graph; essentially 4-edge-connected graph; spanning Eulerian subgraph PDF BibTeX XML Cite \textit{Z.-H. Chen} et al., J. Comb. Math. Comb. Comput. 59, 165--171 (2006; Zbl 1124.05054)