✦ LIBER ✦

Non-hamiltonian 3-connected cubic bipartite graphs

✍ Scribed by M.N Ellingham; J.D Horton

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 160 KB
Volume: 34
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90046-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The smallest non-hamiltonian 3-connected

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

✍ D.A Holton; B.D McKay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Some 3-connected 4-edge-critical non-Ham

Some 3-connected 4-edge-critical non-Hamiltonian graphs

✍ Yang Yuansheng; Zhao Chengye; Lin Xiaohui; Jiang Yongsong; Hao Xin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 1 views

## Abstract Let γ(__G__) be the domination number of graph __G__, thus a graph __G__ is __k__‐edge‐critical if γ (__G__) = k, and for every nonadjacent pair of vertices __u__ and υ, γ(__G__ + __u__υ) = k−1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjectu

On locating cubic subgraphs in bounded-d

On locating cubic subgraphs in bounded-degree connected bipartite graphs

✍ Iain A Stewart 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete.

The smallest 2-connected cubic bipartite

The smallest 2-connected cubic bipartite planar nonhamiltonian graph

✍ Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 519 KB

## Butte producxd ihe first example of a 3-connected cubic planar nonhamihonian gJaph. On adding the cxmcition that the graph must he bipartite and admitting 2-connected graphs. We prove that the smallest possible such graph has 26 points and is unique.

Hamiltonian cycles in 3-connected claw-f

Hamiltonian cycles in 3-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views

On some conjectures on cubic 3-connected

On some conjectures on cubic 3-connected graphs

✍ Jean-Luc Fouquet; Henri Thuillier 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Our purpose is to consider the following conjectures: Conjecture 1 (Barneffe). . Every cubic 3-connected bipartite planar graph is Hamiltonian. Conjecture 2 (Jaeger). Every cubic cyclically 4-edge connected graph G has a cycle C such that G -V(C) is acyclic. Conjecture 3 (Jackson, Fleischner). Ever