𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonicity in graphs with fewP4's

✍ Scribed by W. Hochstättler; G. Tinhofer

Publisher
Springer Vienna
Year
1995
Tongue
English
Weight
641 KB
Volume
54
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonicity in 2-connected graphs with
Hamiltonicity in 2-connected graphs with claws
✍ Hao Li; Mei Lu; Zhiren Sun 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Matthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order n such that 6>~(n-2)/3, then G is hamiltonian. Li has shown that the bound for the minimum degree 6 can be reduced to n/4 under the additional condition that G is not in /7, where /7 is a class of graphs defi

Hamiltonicity in balancedk-partite graph
Hamiltonicity in balancedk-partite graphs
✍ Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesn 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 538 KB
Hamiltonicity and forbidden subgraphs in
Hamiltonicity and forbidden subgraphs in 4-connected graphs
✍ Florian Pfender 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract Let __T__ be the line graph of the unique tree __F__ on 8 vertices with degree sequence (3,3,3,1,1,1,1,1), i.e., __T__ is a chain of three triangles. We show that every 4‐connected {__T__, __K__~1,3~}‐free graph has a hamiltonian cycle. © 2005 Wiley Periodicals, Inc. J Graph Theory 49:

Maximal K3's and Hamiltonicity of 4-conn
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
✍ Jun Fujisawa; Katsuhiro Ota 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

## Abstract Let __cl__(__G__) denote Ryjáček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim