Spanning eulerian subgraphs in N2-locally connected claw-free graphs

Hong Jian Lai; Mingchu Li; Yehong Shao; Liming Xiong

Spanning eulerian subgraphs in N²-locally connected claw-free graphs

Hong Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong^*

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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. In this note, we first present a counterexample to the conjecture that every 3-connected, N²-locally connected claw-free graph is hamiltonian and then show that both connected N²-locally connected claw-free graph and connected N³-locally connected claw-free graph with minimum degree at least three have connected even [2, 4]-factors.

Original language	English
Pages (from-to)	191-199
Number of pages	9
Journal	Ars Combinatoria
Volume	94
Publication status	Published - Jan 2010

Cite this

Lai, H. J., Li, M., Shao, Y., & Xiong, L. (2010). Spanning eulerian subgraphs in N²-locally connected claw-free graphs. Ars Combinatoria, 94, 191-199.

@article{f1a0a9f86be048aabfef2f4c82a53cf3,

title = "Spanning eulerian subgraphs in N2-locally connected claw-free graphs",

abstract = "A graph G is Nm -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. In this note, we first present a counterexample to the conjecture that every 3-connected, N2-locally connected claw-free graph is hamiltonian and then show that both connected N2-locally connected claw-free graph and connected N3-locally connected claw-free graph with minimum degree at least three have connected even [2, 4]-factors.",

author = "Lai, {Hong Jian} and Mingchu Li and Yehong Shao and Liming Xiong",

year = "2010",

month = jan,

language = "English",

volume = "94",

pages = "191--199",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Spanning eulerian subgraphs in N2-locally connected claw-free graphs

AU - Lai, Hong Jian

AU - Li, Mingchu

AU - Shao, Yehong

AU - Xiong, Liming

PY - 2010/1

Y1 - 2010/1

N2 - A graph G is Nm -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. In this note, we first present a counterexample to the conjecture that every 3-connected, N2-locally connected claw-free graph is hamiltonian and then show that both connected N2-locally connected claw-free graph and connected N3-locally connected claw-free graph with minimum degree at least three have connected even [2, 4]-factors.

AB - A graph G is Nm -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. In this note, we first present a counterexample to the conjecture that every 3-connected, N2-locally connected claw-free graph is hamiltonian and then show that both connected N2-locally connected claw-free graph and connected N3-locally connected claw-free graph with minimum degree at least three have connected even [2, 4]-factors.

UR - http://www.scopus.com/inward/record.url?scp=77949513937&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77949513937

SN - 0381-7032

VL - 94

SP - 191

EP - 199

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Spanning eulerian subgraphs in N²-locally connected claw-free graphs

Abstract

Other files and links

Fingerprint

Cite this