Long Alternating Cycles in Edge-Colored Complete Graphs

DOI10.1007/978-3-540-73814-5_29MaRDI QIDQ3612596zbMATH OpenOpenAlexFDO

Authors Hao Li, Guanghui Wang, Shan Zhou

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

alternating cyclecolor degreeedge-colored graph

Mathematics Subject Classification ID

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

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

Cited in

(12)

• Color degree and alternating cycles in edge-colored graphs
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs
• Alternating Hamiltonian cycles
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
• Optimal pathway reconstruction on 3D NMR maps
• Long properly colored cycles in edge colored complete graphs
• Fork-forests in bi-colored complete bipartite graphs
• Alternating cycles in edge-colored graphs
• scientific article; zbMATH DE number 6470879 (Why is no real title available?)
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• Edge-colored complete graphs with alternating cycles

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)