𝔖 Bobbio Scriptorium
✦   LIBER   ✦

-decompositions of some regular graphs

✍ Scribed by R.S. Manikandan; P. Paulraja


Book ID
108113563
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
902 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Decompositions of regular bipartite grap
✍ 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
✍ 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

A result on decompositions of regular gr
✍ Xiang-Ying Su πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 224 KB

A result on decompositions of regular graphs, Discrete Mathematics 105 (1992) 323-326. We prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that x(H) = x(G) and o