✦ LIBER ✦

On connected factors inK1,3-free graphs

✍ Scribed by Li Guojun; Giu Zhenhong

Book ID: 110618142
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1998
Tongue: English
Weight: 276 KB
Volume: 14
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02677347

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dominating sets and hamiltonicity inK1,3

Dominating sets and hamiltonicity inK1,3-free graphs

✍ A. A. Ageev 📂 Article 📅 1994 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 271 KB

On 2-Connected Spanning Subgraphs with B

On 2-Connected Spanning Subgraphs with Bounded Degree inK1,r-Free Graphs

✍ Roman Kužel; Jakub Teska 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 236 KB

On factors of 4-connected claw-free grap

On factors of 4-connected claw-free graphs

✍ H. J. Broersma; M. Kriesell; Z. Ryjác̆ek 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We consider the existence of several different kinds of factors in 4‐connected claw‐free graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4‐connected line graph is hamiltonian,

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

Finding Independent Sets inK4-Free 4-Reg

Finding Independent Sets inK4-Free 4-Regular Connected Graphs

✍ Stephen C. Locke; Feng Lou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Connected, locally 2-connected, K1,3-fre

Connected, locally 2-connected, K1,3-free graphs are panconnected

✍ S. V. Kanetkar; P. R. Rao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

## Abstract A graph __G__ is locally __n__‐connected, __n__ ≥ 1, if the subgraph induced by the neighborhood of each vertex is __n__‐connected. We prove that every connected, locally 2‐connected graph containing no induced subgraph isomorphic to __K__~1,3~ is panconnected.