✦ LIBER ✦

Partition of odd regular graphs into bistars

✍ Scribed by Francois Jaeger; Charles Payan; Mekkia Kouider

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 84 KB
Volume: 46
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90275-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning regular graphs into equicar

Partitioning regular graphs into equicardinal linear forests

✍ R.E.L. Aldred; Bill Jackson; Dingjun Lou; Akira Saito 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 521 KB

components are paths.

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

Factorization of regular multigraphs int

Factorization of regular multigraphs into regular graphs

✍ S. I. El-Zanati; M. J. Plantholt; S. K. Tipnis 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

## Abstract A regular multigraph with maximum multiplicity __r__ and degree __rs__ cannot always be factored into __r s__‐regular simple graphs. It is shown, however, that under general conditions a similar factorization can be achieved if we first allow the addition or deletion of a relatively sma

Homomorphisms of graphs into odd cycles

✍ A. M. H. Gerards 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

Pseudo-one-factorizations of regular gra

Pseudo-one-factorizations of regular graphs of odd order — II. products of graphs

✍ Guo-Hui Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 693 KB

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.