✦ LIBER ✦

Closed trail decompositions of some classes of regular graphs

✍ Scribed by P. Paulraja; S. Sampath Kumar

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Closed trail decompositions of complete

Closed trail decompositions of complete equipartite graphs

✍ Andrea Burgess; Mateja Šajna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

## Abstract The complete equipartite graph \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$K\_m \* {\overline{K\_n}}$\end{document} has mn vertices partitioned into __m__ parts of size __n__, with two vertices adjacent if and only if they are in different parts. In this paper,

-decompositions of some regular graphs

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

Some minor-closed classes of signed grap

Some minor-closed classes of signed graphs

✍ Slilaty, Daniel; Zhou, Xiangqian 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 431 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,

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

P4-decompositions of regular graphs

✍ Heinrich, Katherine; Liu, Jiping; Yu, Minli 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

In this article, we show that every simple r-regular graph G admits a balanced P 4 -decomposition if r ≡ 0(mod 3) and G has no cut-edge when r is odd. We also show that a connected 4-regular graph G admits a P 4 -decomposition if and only if |E(G)| ≡ 0(mod 3) by characterizing graphs of maximum degr