✦ LIBER ✦

Counting labelled 3-connected graphs

✍ Scribed by Nicholas Wormald

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 62 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010413

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclability of 3-connected graphs

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

Connected Spanning Subgraphs of 3-Connec

Connected Spanning Subgraphs of 3-Connected Planar Graphs

✍ Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

2-Connected Spanning Subgraphs of Planar

2-Connected Spanning Subgraphs of Planar 3-Connected Graphs

✍ D.W. Barnette 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.

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

Contractile Triples in 3-Connected Graph

Contractile Triples in 3-Connected Graphs

✍ W. Mccuaig; K. Ota 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 295 KB

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.