Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result

DOI10.1016/j.disc.2021.112573zbMath1472.05055OpenAlexW3187380656MaRDI QIDQ1981705

Ruonan Li

Publication date: 6 September 2021

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

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

zbMATH Keywords

polynomial algorithmHamilton cycleedge-colored graphvertex pancyclicitymonochromatic triangleproperly edge-colored cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs ⋮ Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properly colored paths and cycles
• Alternating Hamiltonian cycles
• On cycles in multipartite tournaments
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• A classification of edge-colored graphs based on properly colored walks
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Cycle extension in edge-colored complete graphs
• Multipartite tournaments: a survey
• Pancyclic and Bipancyclic Graphs
• Properly Coloured Cycles and Paths: Results and Open Problems
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• Edge colorings of complete graphs without tricolored triangles
• Long properly coloured cycles in edge‐coloured graphs
• An Edge-Colored Version of Dirac's Theorem
• Digraphs
• On Subtournaments of a Tournament
• Transitiv orientierbare Graphen
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result