✦ LIBER ✦

4-Connected Projective-Planar Graphs Are Hamiltonian

✍ Scribed by R. Thomas; X.X. Yu

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 923 KB
Volume: 62
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1058

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Re-embedding structures of 4-connected p

Re-embedding structures of 4-connected projective-planar graphs

✍ Yusuke Suzuki 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

We identify the structures of 4-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane, showing two series of graphs the number of whose inequivalent embeddings is held by O(n) with respect to the number of its vertices n.

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.

Five-Connected Toroidal Graphs Are Hamil

Five-Connected Toroidal Graphs Are Hamiltonian

✍ Robin Thomas; Xingxing Yu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 518 KB

We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cycle. Our proof is constructive and implies a polynomial time algorithm for finding a Hamilton cycle. ## 1997 Academic Press On the other hand, for 4-connected graphs embedded in the torus, certain ed

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

Bounding the number of embeddings of 5-c

Bounding the number of embeddings of 5-connected projective-planar graphs

✍ Shigeru Kitakubo 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).

3-Connected line graphs of triangular gr

3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian

✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3-connected. Furthermore, the line graph of a k-triangular graph is k-harniltonian