Spanning eulerian subgraphs in N 2 -locally connected claw-free graphs.
Hong‐Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong · 2010
A graph G is N m-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N²-locally connected claw-free graph and 3-edge-connected N²-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].