๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On cyclic decompositions of the complete graph into the 2-regular graphs

โœ Scribed by Zhihe Liang

Book ID
105626324
Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
222 KB
Volume
24
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Decompositions of complete graphs into r
Decompositions of complete graphs into regular bichromatic factors
โœ Anton Kotzig ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 517 KB

The proof of the following theorem is given: A complete graph with n vertkes can he decomposed into r regular bichromatic factors if and only if n is even and greater thl;iirl 4 and there exists $1 natural number k with the properties that k < r anu. ak-l < n 5 Zk.

Decompositions of complete graphs into r
Decompositions of complete graphs into regular bichromatic factors
โœ Anton Kotzig ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 425 KB

Abstxact. The purpose of this paper is to find iI nccessar) and sufficient condition fltr the euis-trn~~ of ;L decoillposi!ion of a ~omplcte graph with given number of vc;tices into regular bichro-ma% ticfor ;uld v.1 artswcr thy' question what is the possible number of factors in such a de-c~?rnp~~i