Menu
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.