✦ LIBER ✦

Neighborhood unions and disjoint chorded cycles in graphs

✍ Scribed by Shengning Qiao

Book ID: 113567481
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 222 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.10.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighborhood Unions for the Existence of

Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs

✍ Yunshu Gao, Guojun Li, Jin Yan 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 191 KB

Disjoint cycles with chords in graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'

Spanning Cyclic Subdivisions of Vertex-D

Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs

✍ Shengning Qiao; Shenggui Zhang 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 134 KB

Vertex-disjoint chorded cycles in a grap

Vertex-disjoint chorded cycles in a graph

✍ Shengning Qiao; Shenggui Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB

On a Sharp Degree Sum Condition for Disj

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

✍ Shuya Chiba; Shinya Fujita; Yunshu Gao; Guojun Li 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 217 KB

Long dominating cycles and paths in grap

Long dominating cycles and paths in graphs with large neighborhood unions

✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 1 views

## Abstract Let __G__ be a graph of order __n__ and define __NC(G)__ = min{|__N__(__u__) ∪ __N__(__v__)| |__uv__ ∉ __E__(__G__)}. A cycle __C__ of __G__ is called a __dominating cycle__ or __D__‐__cycle__ if __V__(__G__) ‐ __V__(__C__) is an independent set. A __D__‐__path__ is defined analogously.