✦ LIBER ✦

A classification of 4-connected graphs

✍ Scribed by Peter J Slater

Book ID: 107884018
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 998 KB
Volume: 17
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90034-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uncontractable 4-connected graphs

✍ Nicola Martinov 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract The only uncontractable 4‐connected graphs are __C__^2^~__n__~ for __n__ ≥ 5 and the line graphs of the cubic cyclically 4‐connected graphs.

Hamiltonicity of 4-connected graphs

✍ Hao Li; Feng Tian; Zhi Xia Xu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB

Minors of quasi 4-connected graphs

✍ Themistocles Politof; A. Satyanarayana 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 744 KB

A minimal point disconnecting set S of a graph G is a nontrivial m-separator, where m=IS), if the connected components of G-S can be partitioned into two sets each of which has at least two points. A 3-connected graph is quasi 4-connected if it has no nontrivial S-separators. Let G be a quasi 4-conn

Generating planar 4-connected graphs

✍ David Barnette 📂 Article 📅 1973 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 498 KB

Minimally 4-edge# -connected graphs

✍ Bernard Peroche; Christine Virlouvet 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 650 KB

In this article, we deal with a connectivity problem stated by Maurer and Slater to characterize minimally k-edge'-connected graphs. This problem has been solved for k = 1,2 and 3, and we recall herein the results obtained. Then we give some partial results concerning the case k =4: representation o

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.