✦ LIBER ✦

Forbidden triples for hamiltonicity

✍ Scribed by Jan Brousek

Book ID: 108315702
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 94 KB
Volume: 251
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00326-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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;

Forbidden triples for perfect matchings

✍ Katsuhiro Ota; Michael D. Plummer;; Akira Saito 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. Plummer and Saito [J Graph Theory 50 (2005), 1-12] and Fujita et al. [J Combin Theory Ser B 96 (2006), 315-324] characterized all H with |H| ≤ 2 such that every connected H

Forbidden Subgraphs for Hamiltonicity of

Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs

✍ Jun Fujisawa 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 572 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:

Characterizing forbidden clawless triple

Characterizing forbidden clawless triples implying hamiltonian graphs

✍ R.J. Faudree; R.J. Gould; M.S. Jacobson; L.L. Lesniak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 135 KB

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