✦ LIBER ✦

Contractile Triples in 3-Connected Graphs

✍ Scribed by W. Mccuaig; K. Ota

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 295 KB
Volume: 60
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1022

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that every 3-connected graph (G) of order at least nine has two adjacent edges (x y) and (y z) such that the graph obtained from (G) by contracting (x, y), and (z) into a single vertex is also 3-connected. (i) 1994 Academic Press. Inc.

📜 SIMILAR VOLUMES

Vertex suppression in 3-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract To __suppress__ a vertex $v$ in a finite graph __G__ means to delete it and add an edge from __a__ to __b__ if __a__, __b__ are distinct nonadjacent vertices which formed the neighborhood of $v$. Let $G--x$ be the graph obtained from $G-x$ by suppressing vertices of degree at most 2 as

Removable edges in 3-connected graphs

✍ Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB

## Abstract An edge __e__ of a 3‐connected graph __G__ is said to be __removable__ if __G__ ‐ __e__ is a subdivision of a 3‐connected graph. If __e__ is not removable, then __e__ is said to be __nonremovable.__ In this paper, we study the distribution of removable edges in 3‐connected graphs and pr

Long Cycles in 3-Connected Graphs

✍ Guantao Chen; Xingxing Yu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Moon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, then G contains a cycle of length at least Oðn log 3 2 Þ: In this paper, this conjecture is proved. In addition, the same result is proved for 3-connected graphs embeddable in the projective plane, or the torus

Contractible Subgraphs in 3-Connected Gr

Contractible Subgraphs in 3-Connected Graphs

✍ Matthias Kriesell 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 154 KB

A subgraph H of a 3-connected finite graph G is called contractible if H is connected and G&V(H) is 2-connected. This work is concerned with a conjecture of McCuaig and Ota which states that for any given k there exists an f (k) such that any 3-connected graph on at least f (k) vertices possesses a

Cyclability of 3-connected graphs

✍ Amel Harkat-Benhamdine; Hao Li; Feng Tian 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

Counting labelled 3-connected graphs

✍ Nicholas Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB