✦ LIBER ✦

A conjecture on a caracterisation of all 4-connected planar graphs

✍ Scribed by Paolo Manca

Book ID: 110606827
Publisher: Springer Milan
Year: 1978
Tongue: English
Weight: 86 KB
Volume: 1
Category: Article
ISSN: 1593-8883
DOI: 10.1007/bf02642668

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On spanning subgraphs of 4-connected pla

On spanning subgraphs of 4-connected planar graphs

✍ Moshe Rosenfeld 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Generating all 3-connected 4-regular pla

Generating all 3-connected 4-regular planar graphs from the octahedron graph

✍ H. J. Broersma; A. J. W. Duijvestijn; F. Göbel 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB 👁 1 views

## Abstract We prove that all 3‐connected 4‐regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all con

Proof of a conjecture of Dirac concernin

Proof of a conjecture of Dirac concerning 4-critical planar graphs

✍ H.L. Abbott; M. Katchalski; B. Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 214 KB

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

A conjecture on the algebraic connectivi

A conjecture on the algebraic connectivity of connected graphs with fixed girth

✍ Ji-Ming Guo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 306 KB

A classification of 4-connected graphs

✍ Peter J Slater 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 998 KB