✦ LIBER ✦

The entire graph of a bridgeless connected plane graph is hamiltonian

✍ Scribed by Arthur M. Hobbs; John Mitchem

Book ID: 107748224
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 779 KB
Volume: 16
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90101-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Every 4-Connected Line Graph of a Planar

Every 4-Connected Line Graph of a Planar Graph is Hamiltonian

✍ Hong-Jian Lai 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 217 KB

Hamiltonian cycles of a connected graph

✍ L. M. Likhtenbaum 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 291 KB

The square of every two-connected graph

The square of every two-connected graph is Hamiltonian

✍ Herbert Fleischner 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 318 KB

On spanning subgraphs of a connected bri

On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs

✍ Herbert Fleischner 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 694 KB

Finding all the hamiltonian paths of a g

Finding all the hamiltonian paths of a graph and investigation of hamiltonian-connected graphs

✍ V.P. Kozyrev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 700 KB

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap