✦ LIBER ✦

Strongly Regular Decompositions of the Complete Graph

✍ Scribed by Edwin R. van Dam

Book ID: 110429184
Publisher: Springer
Year: 2003
Tongue: English
Weight: 149 KB
Volume: 17
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1022939017002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On cyclic decompositions of the complete

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

✍ Zhihe Liang 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 222 KB

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

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

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

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.