✦ LIBER ✦

Extending Edge-Colorings of Complete Graphs and Independent Edges

✍ Scribed by LARS DØVLING ANDERSEN; A.J.W. HILTON

Book ID: 119862748
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 617 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16380.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decompositions of Edge-Colored Complete

Decompositions of Edge-Colored Complete Graphs

✍ Esther R. Lamken; Richard M. Wilson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We prove an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many combinatorial design problems fall within this framework. Applications of our main theorem require calculations involving the numbers of edges of each color and

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

2-Colored triangles in edge-colored comp

2-Colored triangles in edge-colored complete graphs

✍ D.T Busolini 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 82 KB

Edge-colored complete graphs with precis

Edge-colored complete graphs with precisely colored subgraphs

✍ F. R. K. Chung; R. L. Graham 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 431 KB

Alternating paths in edge-colored comple

Alternating paths in edge-colored complete graphs

✍ Y. Manoussakis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 897 KB

Edge-colored complete graphs with altern

Edge-colored complete graphs with alternating cycles

✍ S.H. Whitesides 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 648 KB

We prove that if the edges of the complete graph on n ~4 vertices are colored so that no vertex is on more than A edges of the same color, 1 c A < n -2,, then the graph has cycles of all lengths 3 through n with no A consecutive edges the same color.