✦ LIBER ✦

Decomposing a star graph into disjoint cycles

✍ Scribed by K. Qiu; H. Meijer; S. Akl

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 580 KB
Volume: 39
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90107-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint cycles in star-free graphs

✍ Markus, Lisa R.; Snevily, Hunter S. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB 👁 3 views

A graph is claw-free if it does not contain K l , 3 as an induced subgraph. It is Kl,,-free if it does not contain K l , r as an induced subgraph. We show that if a graph is Kl,,-free ( r 2 4), only p + 2r -1 edges are needed to insure that G has t w o disjoint cycles. As an easy consequence w e ge

Decomposing the complete graph into cycl

Decomposing the complete graph into cycles of many lengths

✍ Darryn E. Bryant; Peter Adams 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 346 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

Two vertex-disjoint cycles in a graph

✍ Hong Wang 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 499 KB

Decomposing complete equipartite graphs

Decomposing complete equipartite graphs into short even cycles

✍ Benjamin R. Smith; Nicholas J. Cavenagh 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.

Large Vertex-Disjoint Cycles in a Bipart

Large Vertex-Disjoint Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 100 KB