A classification of edge-colored graphs based on properly colored walks

DOI10.1016/j.dam.2020.02.008zbMath1442.05061OpenAlexW3008334527MaRDI QIDQ2192112

Ruonan Li, Bin Long Li, Sheng Gui Zhang

Publication date: 29 June 2020

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

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

zbMATH Keywords

cyclesdigraphswalksedge-colored graphsproperly colored

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result ⋮ Edge-colored complete graphs containing no properly colored odd cycles

Cites Work

• Unnamed Item
• Chinese postman problem on edge-colored multigraphs
• Properly colored paths and cycles
• Color degree and alternating cycles in edge-colored graphs
• Alternating cycles in edge-partitioned graphs
• A note on alternating cycles in edge-coloured graphs
• Decomposing edge-colored graphs under color degree constraints
• Properly edge-colored theta graphs in edge-colored complete graphs
• Acyclicity in edge-colored graphs
• 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
• Transitiv orientierbare Graphen

This page was built for publication: A classification of edge-colored graphs based on properly colored walks