Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three

DOI10.1016/j.disc.2022.112838zbMath1486.05094OpenAlexW4211127835MaRDI QIDQ2124635

Luyi Li, Jinjiang Yuan, Fei Huang

Publication date: 11 April 2022

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

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

zbMATH Keywords

edge-colored graphproper cycleminimum color degreeproper vertex-pancyclicity

Mathematics Subject Classification ID

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

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
• Color degree sum conditions for rainbow triangles in edge-colored graphs
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
• Properly colored paths and cycles
• Color degree and alternating cycles in edge-colored graphs
• Graphs with cycles having adjacent lines different colors
• Properly edge-colored theta graphs in edge-colored complete graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Rainbow triangles in edge-colored graphs
• Edge colorings of complete graphs without tricolored triangles
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• An Edge-Colored Version of Dirac's Theorem
• A Dirac Type Condition for Properly Coloured Paths and Cycles
• Some Theorems on Abstract Graphs

This page was built for publication: Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three