Edge-colored complete graphs containing no properly colored odd cycles

DOI10.1007/S00373-021-02312-XzbMath1470.05055OpenAlexW3147001453MaRDI QIDQ2045403

Ruonan Li, Yan Dong Bai, Tingting Han, Sheng Gui Zhang

Publication date: 12 August 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02312-x

zbMATH Keywords

cycle lengthedge-colored complete graphGallai partitionproperly colored odd cycle

Mathematics Subject Classification ID

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

Related Items (2)

Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Odd properly colored cycles in edge-colored graphs
• Gallai colorings of non-complete graphs
• A note on alternating cycles in edge-coloured graphs
• A classification of edge-colored graphs based on properly colored walks
• On rainbow-cycle-forbidding edge colorings of finite graphs
• Disconnected Colors in Generalized Gallai-Colorings
• Extensions of Gallai-Ramsey results
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• A complete bipartite graph without properly colored cycles of length four
• Colored complete hypergraphs containing no rainbow Berge triangles
• Transitiv orientierbare Graphen
• Edge‐colored complete graphs without properly colored even cycles: A full characterization

This page was built for publication: Edge-colored complete graphs containing no properly colored odd cycles