Spanning Eulerian Subgraphs in claw-free graphs
This is the pre-refereed version
A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.
Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo, and Yehomg Shao. "Spanning Eulerian Subgraphs in claw-free graphs" Journal of Combinatorial Math and Combinatorial Computing 59 (2006): 165-171.
Available at: http://works.bepress.com/zhi_hong_chen/4