✦ LIBER ✦

Enumeration of cyclically 4-connected cubic graphs

✍ Scribed by Nicholas C. Wormald

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 550 KB
Volume: 9
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190090418

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclically 5-edge-connected cubic planar

Cyclically 5-edge-connected cubic planar graphs and shortness coefficients

✍ P. J. Owens 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

## Abstract It is shown that some classes of cyclically 5‐edge‐connected cubic planar graphs with only one type of face besides pentagons contain non‐Hamiltonian members and have shortness coefficients less than unity.

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.

Enumeration of Cubic Graphs by Inclusion

Enumeration of Cubic Graphs by Inclusion–Exclusion

✍ William Y.C. Chen; James D. Louck 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We use the principle of inclusion and exclusion to enumerate labeled cubic graphs, without resort to the superposition theory of Read. This work was motivated by the cubic array representation of cubic graphs in the studies of generating functions of 3n& j coefficients in angular momentum theory.

On the Number of Cycles in 3-Connected C

On the Number of Cycles in 3-Connected Cubic Graphs

✍ R.E.L Aldred; Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie

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.

Unavoidable parallel minors of 4-connect

Unavoidable parallel minors of 4-connected graphs

✍ Carolyn Chun; Guoli Ding; Bogdan Oporowski; Dirk Vertigan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract A __parallel minor__ is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer __k__, every internally 4‐connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of __K__~4,__k