✦ LIBER ✦

A recursive characterization of the 4-connected graphs

✍ Scribed by Nicola Martinov

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 244 KB
Volume: 84
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90277-o

No coin nor oath required. For personal study only.

✦ Synopsis

We present a complete description of the set of 4-connected contraction-critical graphs.

📜 SIMILAR VOLUMES

A characterization of weakly four-connec

A characterization of weakly four-connected graphs

✍ Tibor Jordán 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract A graph __G__ = (__V__, __E__) is called weakly four‐connected if __G__ is 4‐edge‐connected and __G__ − __x__ is 2‐edge‐connected for all __x__ ∈ __V__. We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four‐connected graphs. By using thes

The structure of quasi 4-connected graph

The structure of quasi 4-connected graphs

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

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

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

A characterization of 3-connected graphs

A characterization of 3-connected graphs containing a given graph

✍ Seiya Negami 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 329 KB

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.

Characterization of maximum critically 2

Characterization of maximum critically 2-connected graphs

✍ R. C. Entringer 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract A graph __G__ is critically 2‐connected if __G__ is 2‐connected but, for any point __p__ of __G, G — p__ is not 2‐connected. Critically 2‐connected graphs on __n__ points that have the maximum number of lines are characterized and shown to be unique for __n__ ⩾ 3, __n__ ≠ 11.