✦ LIBER ✦

Quadrangularly connected claw-free graphs

✍ Scribed by MingChu Li; Cheng Guo; Liming Xiong; Dengxin Li; Hong-Jian Lai

Book ID: 108113719
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 187 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.07.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian Connected Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 395 KB

9-Connected Claw-Free Graphs Are Hamilto

9-Connected Claw-Free Graphs Are Hamilton-Connected

✍ Stephan Brandt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced claw K 1, 3 are Hamilton-connected, by reformulating and localizing a closure concept due to Ryja c ek, which turns claw-free graphs into l

Panconnectivity of locally connected cla

Panconnectivity of locally connected claw-free graphs

✍ Yu Sheng; Feng Tian; Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Connected even factors in claw-free grap

Connected even factors in claw-free graphs

✍ MingChu Li; Liming Xiong; H.J. Broersma 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Hamiltonian N2-locally connected claw-fr

Hamiltonian N2-locally connected claw-free graphs

✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja ´c ˇek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.