✦ LIBER ✦

Collapsible Graphs and Hamiltonicity of Line Graphs

✍ Scribed by Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo

Book ID: 120788819
Publisher: Springer Japan
Year: 2013
Tongue: English
Weight: 173 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1280-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Collapsible graphs and Hamiltonian conne

Collapsible graphs and Hamiltonian connectedness of line graphs

✍ Weihua Yang; Hongjian Lai; Hao Li; Xiaofeng Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Bipartite Graphs, Hamiltonicity and grap

Bipartite Graphs, Hamiltonicity and graphs

✍ Rahman, M. Sohel; Kaykobad, M.; Kaykobad, Md. Tanvir 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Hamiltonicity of 3-connected line graphs

✍ Weihua Yang; Liming Xiong; Hongjian Lai; Xiaofeng Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Hamilton connectivity of line graphs and

Hamilton connectivity of line graphs and claw-free graphs

✍ Zhiquan Hu; Feng Tian; Bing Wei 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(ν) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≤ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co

On the hamiltonicity of line graphs of l

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

Collapsible graphs and matchings

✍ Zhi-Hong Chen; Hong-Jian Lai 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract A graph __G__ is __collapsible__ if for every even subset __R__ ⊆ __V__(__G__), there is a spanning connected subgraph of __G__ whose set of odd degree vertices is __R__. A graph is __reduced__ if it does not have nontrivial collapsible subgraphs. Collapsible and reduced graphs are defi