Long Alternating Cycles in Edge-Colored Complete Graphs

DOI10.1007/978-3-540-73814-5_29zbMath1214.05059OpenAlexW1505561985MaRDI QIDQ3612596

Shan Zhou, Guang-Hui Wang, Hao Li

Publication date: 10 March 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73814-5_29

zbMATH Keywords

color degreeedge-colored graphalternating cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Properly coloured Hamiltonian cycles in edge-coloured complete graphs ⋮ Long properly colored cycles in edge colored complete graphs ⋮ Fork-forests in bi-colored complete bipartite graphs ⋮ Optimal pathway reconstruction on 3D NMR maps ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs

This page was built for publication: Long Alternating Cycles in Edge-Colored Complete Graphs