✦ LIBER ✦

Decompositions of complete graphs into regular bichromatic factors

✍ Scribed by Anton Kotzig

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 517 KB
Volume: 4
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90115-5

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

Decompositions of regular graphs into Kn

Decompositions of regular graphs into Knc ∨ 2K2

✍ R. Balakrishnan; R. Sampathkumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The join K~ V2K2 is the graph obtained by taking a copy ofK, ~ and two disjoint copies of K2, disjoint from K c, and joining every vertex of K, c to every vertex of 2K2. In this paper we show that for each positive integer n, the graph K, ~ V 2/(2 admits a p-valuation and has gracefulness 4n + 3. Fu

Almost regular edge colorings and regula

Almost regular edge colorings and regular decompositions of complete graphs

✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge

r-Regular, r-connected decompositions of

r-Regular, r-connected decompositions of complete graphs

✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.

Hamiltonian decompositions of complete r

Hamiltonian decompositions of complete regular s-partite graphs

✍ A.J.W. Hilton; C.A. Rodger 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 962 KB

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K~.....,~, where (s-1)n is even, can be constructed. For 2t<~s, l<~al<~...<~a~n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of Kal.a2..... ~ into (s-1)n/2 class

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