✦ LIBER ✦

Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs

✍ Scribed by Yunshu Gao, Guojun Li, Jin Yan

Book ID: 120788742
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 191 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1200-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighborhood unions and disjoint chorded

Neighborhood unions and disjoint chorded cycles in graphs

✍ Shengning Qiao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 222 KB

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

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

On the Existence of Disjoint Cycles in a

On the Existence of Disjoint Cycles in a Graph

✍ Hikoe Enomoto 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 129 KB

On a Neighborhood Condition Implying the

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs

✍ Faudree, Ralph; Jacobson, Michael S.; Gould, Ronald J.; Lesniak, Linda 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 450 KB

The Ramsey numbers for disjoint unions o

The Ramsey numbers for disjoint unions of cycles

✍ Tristan Denley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 671 KB

As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting