✦ LIBER ✦

Partition of the edges of the directed complete graph into 4-cycles

✍ Scribed by J. Schönheim

Book ID: 107748211
Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 336 KB
Volume: 11
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90105-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partition of a directed bipartite graph

Partition of a directed bipartite graph into two directed cycles

✍ Hong Wang; Charles Little; Kee Teo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Let D = (V1, V2; A) be a directed bipartite graph with II/11 = 11/21 = n ~> 2. Suppose that do(x) + do(y) >~ 3n + 1 for all xe I/1 and ye V2. Then D contains two vertex-disjoint directed cycles of lengths 2nl and 2n2, respectively, for any positive integer partition n = n~ + n2. Moreover, the condit

Decomposition of the completer-graph int

Decomposition of the completer-graph into completer-partiter-graphs

✍ Noga Alon 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 307 KB

Edge partitions of the complete symmetri

Edge partitions of the complete symmetric directed graph and related designs

✍ Brian Alspach; Katherine Heinrich; Moshe Rosenfeld 📂 Article 📅 1981 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 521 KB

Edge partitions of complete multipartite

Edge partitions of complete multipartite graphs into equal length circuits

✍ E.J Cockayne; B.L Hartnell 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Decomposing the complete graph into cycl

Decomposing the complete graph into cycles of many lengths

✍ Darryn E. Bryant; Peter Adams 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 346 KB

Decomposition of the complete directed g

Decomposition of the complete directed graph into k-circuits

✍ J.C Bermond; V Faber 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 518 KB