Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs

DOI10.1016/j.disc.2022.113197zbMath1502.05061OpenAlexW4297985284MaRDI QIDQ2092426

Xiaozheng Chen, Xue Liang Li

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113197

zbMATH Keywords

(maximum) monochromatic-degree(minimum) color-degreeedge-colored (complete) graphproperly colored cycle (path)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Properly colored paths and cycles
• Color degree and alternating cycles in edge-colored graphs
• Alternating cycles in edge-partitioned graphs
• Hamiltonian circuits in random graphs
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• A note on alternating cycles in edge-coloured graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Cycle extension in edge-colored complete graphs
• Long properly colored cycles in edge colored complete graphs
• Long Alternating Cycles in Edge-Colored Complete Graphs
• Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
• A Dirac Type Condition for Properly Coloured Paths and Cycles

This page was built for publication: Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs