✦ LIBER ✦

Counting labeled general cubic graphs

✍ Scribed by Gab-Byung Chae; Edgar M. Palmer; Robert W. Robinson

Book ID: 108113782
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 218 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting labeled claw-free cubic graphs

Counting labeled claw-free cubic graphs by connectivity

✍ Gab-Byung Chae 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Counting cubic graphs

✍ Robert W. Robinson 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

Counting labelled chordal graphs

✍ Nicholas C. Wormald 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 427 KB

Antimagic Labeling of Cubic Graphs

✍ Liang, Yu-Chang; Zhu, Xuding 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 485 KB

Counting labelled 3-connected graphs

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

Fast generation of cubic graphs

✍ Brinkmann, Gunnar 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 620 KB

In this paper an efficient algorithm to generate regular graphs with small vertex valency is presented. The running times of a program based on this algorithm and designed to generate cubic graphs are below two natural benchmarks: (a) If N ( n ) denotes the number of pairwise non-isomorphic cubic gr