✦ LIBER ✦

Ascending subgraph decompositions of regular graphs

✍ Scribed by Hung-Lin Fu; Wei-Hsin Hu

Book ID: 108315736
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 98 KB
Volume: 253
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00445-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the ascending subgraph decompositions

On the ascending subgraph decompositions of regular graphs

✍ Chen Huaitang; Ma Kejie 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 249 KB

Some graphs which have ascending subgrap

Some graphs which have ascending subgraph decomposition

✍ Zhuo Xinjian; Su Yongmei; Ma Kejie 📂 Article 📅 1999 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 469 KB

Regular subgraphs of almost regular grap

Regular subgraphs of almost regular graphs

✍ N Alon; S Friedland; G Kalai 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Decompositions of regular bipartite grap

Decompositions of regular bipartite graphs

✍ Michael S. Jacobson; Miroslaw Truszczyński; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 692 KB

In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,

-decompositions of some regular graphs

✍ R.S. Manikandan; P. Paulraja 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 902 KB

Regular path decompositions of odd regul

Regular path decompositions of odd regular graphs

✍ Odile Favaron; François Genest; Mekkia Kouider 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract Kotzig asked in 1979 what are necessary and sufficient conditions for a __d__‐regular simple graph to admit a decomposition into paths of length __d__ for odd __d__>3. For cubic graphs, the existence of a 1‐factor is both necessary and sufficient. Even more, each 1‐factor is extendable