𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Critical graphs for subpancyclicity of 3-connected claw-free graphs

✍ Scribed by Ronald J. Gould; Tomasz Łuczak; Florian Pfender

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
173 KB
Volume
62
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let ${\cal{F}}_{k}$ be the family of graphs G such that all sufficiently large k ‐connected claw‐free
graphs which contain no induced copies of G are subpancyclic. We show
that for every k≥3 the family ${\cal{F}}_{1}k$ is infinite and make the first step toward the complete characterization of the family ${\cal{F}}_{3}$. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 263–278, 2009

📜 SIMILAR VOLUMES

Claw-free 3-connected P11-free graphs ar
Claw-free 3-connected P11-free graphs are hamiltonian
✍ Tomasz Łuczak; Florian Pfender 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 2 views

## Abstract We show that every 3‐connected claw‐free graph which contains no induced copy of __P__~11~ is hamiltonian. Since there exist non‐hamiltonian 3‐connected claw‐free graphs without induced copies of __P__~12~ this result is, in a way, best possible. © 2004 Wiley Periodicals, Inc. J Graph T

Hamiltonian cycles in 3-connected claw-f
Hamiltonian cycles in 3-connected claw-free graphs
✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views

## Abstract In this paper, we show that every 3‐connected claw‐free graph on n vertices with δ ≥ (__n__ + 5)/5 is hamiltonian. © 1993 John Wiley & Sons, Inc.

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

Non-traceability of large connected claw
Non-traceability of large connected claw-free graphs
✍ Frydrych, Wac?w; Skupie?, Zdzis?aw 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 3 views

Let G be a connected claw-free graph on n vertices. Let σ 3 (G) be the minimum degree sum among triples of independent vertices in G. It is proved that if σ 3 (G) ≥ n-3 then G is traceable or else G is one of graphs G n each of which comprises three disjoint nontrivial complete graphs joined togethe

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,