Article
Spanning Eulerian Subgraphs in claw-free graphs
Journal of Combinatorial Mathematics and Combinatorial Computing
Document Type
Article
Publication Date
1-1-2006
Disciplines
Additional Publication URL
http://www.worldcat.org/oclc/204797957
Abstract
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.
Rights
This is a pre-print version of this article. The version of record is available at Worldcat.
Citation Information
Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo and Yehomg Shao. "Spanning Eulerian Subgraphs in claw-free graphs" Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 59 (2006) p. 165 - 172 Available at: http://works.bepress.com/zhi_hong_chen/4/