Long Alternating Cycles in Edge-Colored Complete Graphs

DOI10.1007/978-3-540-73814-5_29zbMATH Open1214.05059OpenAlexW1505561985MaRDI QIDQ3612596FDOQ3612596

Shan Zhou, Guanghui 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

Recommendations

• Alternating Hamiltonian cycles
• Edge-colored complete graphs with alternating cycles
• Long properly colored cycles in edge colored complete graphs
• Color degree and alternating cycles in edge-colored graphs
• scientific article; zbMATH DE number 1067836

zbMATH Keywords

edge-colored graphcolor degreealternating cycle

Mathematics Subject Classification ID

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

Cited In (12)

• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• Alternating Hamiltonian cycles
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Alternating cycles in edge-colored graphs
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
• Fork-forests in bi-colored complete bipartite graphs
• Title not available (Why is that?)
• Optimal pathway reconstruction on 3D NMR maps
• Edge-colored complete graphs with alternating cycles
• Color degree and alternating cycles in edge-colored graphs
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs
• Long properly colored cycles in edge colored complete graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612596)