Journal of Combinatorial Mathematics and Combinatorial Computing
Additional Publication URL
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.
This is a pre-print version of this article. The version of record is available at Worldcat.
Chen, Zhi-Hong; Lai, Hong-Jian; Luo, Weiqi; and Shao, Yehomg, "Spanning Eulerian Subgraphs in claw-free graphs" Journal of Combinatorial Mathematics and Combinatorial Computing / (2006): 165-172.
Available at https://digitalcommons.butler.edu/facsch_papers/144