✦ LIBER ✦

2-Colored triangles in edge-colored complete graphs

✍ Scribed by D.T Busolini

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 82 KB
Volume: 24
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90056-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Properly colored hamilton cycles in edge

Properly colored hamilton cycles in edge-colored complete graphs

✍ N. Alon; G. Gutin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 3 views

It is shown that, for ⑀ ) 0 and n ) n ⑀ , any complete graph K on n vertices 0 ' Ž . whose edges are colored so that no vertex is incident with more than 1 y 1r 2 y ⑀ n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and

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

Edge colorings of complete graphs withou

Edge colorings of complete graphs without tricolored triangles

✍ András Gyárfás; Gábor Simony 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 59 KB

## Abstract We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size

Characterization of edge-colored complet

Characterization of edge-colored complete graphs with properly colored Hamilton paths

✍ Jinfeng Feng; Hans-Erik Giesen; Yubao Guo; Gregory Gutin; Tommy Jensen; Arash Ra 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

## Abstract An edge‐colored graph __H__ is properly colored if no two adjacent edges of __H__ have the same color. In 1997, J. Bang‐Jensen and G. Gutin conjectured that an edge‐colored complete graph __G__ has a properly colored Hamilton path if and only if __G__ has a spanning subgraph consisting

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.

Edge-colored saturated graphs

✍ D. Hanson; B. Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB