Edge-disjoint properly colored cycles in edge-colored complete graphs

DOI10.1016/j.dam.2024.03.005OpenAlexW4392626295MaRDI QIDQ6126721

Xiaozheng Chen, Luyi Li, Xue Liang Li

Publication date: 10 April 2024

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

Full work available at URL: https://doi.org/10.1016/j.dam.2024.03.005

zbMATH Keywords

edge-disjointedge-colored complete graphmaximum monochromatic-degreeproperly colored \(PC\) cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on Hamilton cycles in directed graphs
• Color degree and heterochromatic cycles in edge-colored graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Alternating cycles in edge-partitioned graphs
• A note on alternating cycles in edge-coloured graphs
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Edge-colored complete graphs containing no properly colored odd cycles
• Long properly colored cycles in edge colored complete graphs
• Recent advances on the Hamiltonian problem: survey III
• Rainbow triangles in edge-colored graphs
• Cycles in digraphs– a survey
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
• Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
• On the Number of Vertex-Disjoint Cycles in Digraphs
• Digraphs
• Transitiv orientierbare Graphen
• Properly colored cycles of different lengths in edge-colored complete graphs