✦ LIBER ✦

Counting labeled claw-free cubic graphs by connectivity

✍ Scribed by Gab-Byung Chae

Book ID: 108113921
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 141 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting labeled general cubic graphs

✍ Gab-Byung Chae; Edgar M. Palmer; Robert W. Robinson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 KB

Hamiltonian Connected Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 395 KB

Quadrangularly connected claw-free graph

Quadrangularly connected claw-free graphs

✍ MingChu Li; Cheng Guo; Liming Xiong; Dengxin Li; Hong-Jian Lai 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Hamilton connectivity of line graphs and

Hamilton connectivity of line graphs and claw-free graphs

✍ Zhiquan Hu; Feng Tian; Bing Wei 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(ν) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≤ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co

Paired-Domination in Claw-Free Cubic Gra

Paired-Domination in Claw-Free Cubic Graphs

✍ Odile Favaron; Michael A. Henning 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 377 KB

Counting labelled 3-connected graphs

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