𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subgraphs, closures and hamiltonicity

✍ Scribed by H.J. Broersma; I. Schiermeyer

Book ID
104183138
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
500 KB
Volume
51
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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:

Closure and Forbidden Pairs for Hamilton
Closure and Forbidden Pairs for Hamiltonicity
✍ ZdenΔ›k RyjÑček πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 223 KB

Let C be the claw K 1;3 and N the net, i.e. the only connected graph with degree sequence 333111. It is known (Bedrossian, Thesis, Memphis State University, USA, 1991; Faudree and Gould, Discrete Math. 173 (1997), 45-60) that if X ; Y is a pair of connected graphs, then, for any 2-connected graph G;

A generalization of fan's condition and
A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity
✍ Zhiquan Hu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 591 KB

Let G be a 2-connected graph with n vertices and H be an induced subgraph of G. Denote 6 := {u E V(G): d(o) > n/2}. If there exists a pair of vertices x and y at distance 2 in H such that {x, y} c V(H)\K, then H is called degree light. Let F be the unique graph with degree sequence (1, 1,1,3,3,3). I