✦ LIBER ✦

Packing problems in edge-colored graphs

✍ Scribed by P. Hell; Y. Manoussakis; Zs. Tuza

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 909 KB
Volume: 52
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90148-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-colored saturated graphs

✍ D. Hanson; B. Toft 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 266 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-Packing in Planar Graphs

✍ L. S. Heath; J. P. C. Vergara 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 396 KB

Alternating cycles in edge-colored graph

Alternating cycles in edge-colored graphs

✍ Carol Whitehead 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

We show that the edges of a 2-connected graph can be partitioned into two color classes so that every vertex is incident with edges of each color and every alternating cycle passes through a single edge. We also show that the edges of a simple graph with minimum vertex degree 6 2 2 can be partitione

Monochromatic paths in edge-colored grap

Monochromatic paths in edge-colored graphs

✍ V Chvátal 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 64 KB

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