๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Forbidden subgraphs and Hamiltonian properties of graphs

โœ Scribed by Ronald J. Gould; Michael S. Jacobson

Book ID
107748423
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
344 KB
Volume
42
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Line Graphs and Forbidden Induced Subgra
Line Graphs and Forbidden Induced Subgraphs
โœ Hong-Jian Lai; ฤฝubomฤฑ́r ล oltรฉs ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, S8 olte s gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases. A graph is said to be a dumbbell if it con

Forbidden subgraphs that imply hamiltoni
Forbidden subgraphs that imply hamiltonian-connectedness
โœ Hajo Broersma; Ralph J. Faudree; Andreas Huck; Huib Trommel; Henk Jan Veldman ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 172 KB

## Abstract It is proven that if __G__ is a 3โ€connected clawโ€free graph which is also __H__~1~โ€free (where __H__~1~ consists of two disjoint triangles connected by an edge), then __G__ is hamiltonianโ€connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$ suc