an:05175632
Zbl 1124.05054
Chen, Zhi-Hong; Lai, Hong-Jian; Luo, Weiqi; Shao, Yehong
Spanning Eulerian subgraphs in claw-free graphs
EN
J. Comb. Math. Comb. Comput. 59, 165-171 (2006).
00192518
2006
j
05C45
claw-free graph; essentially 4-edge-connected graph; spanning Eulerian subgraph
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\).
Reinhardt Euler (Brest)