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

DOI10.1016/J.DISC.2022.112838MaRDI QIDQ2124635zbMATH OpenOpenAlexFDO

Authors LuYi Li, F. Huang, Jinjiang Yuan

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) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
• Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
• Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
• Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
• Edge‐colored complete graphs without properly colored even cycles: A full characterization
• scientific article; zbMATH DE number 1506501
• Edge-colored complete graphs containing no properly colored odd cycles
• A generalization of properly colored paths and cycles in edge-colored graphs

Cites work

• scientific article; zbMATH DE number 1067836 (Why is no real title available?)
• A Dirac type condition for properly coloured paths and cycles
• An Edge-Colored Version of Dirac's Theorem
• Color degree and alternating cycles in edge-colored graphs
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• Color degree sum conditions for rainbow triangles in edge-colored graphs
• Edge colorings of complete graphs without tricolored triangles
• Graph theory
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Graphs with cycles having adjacent lines different colors
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Properly colored paths and cycles
• Properly edge-colored theta graphs in edge-colored complete graphs
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
• Rainbow triangles in edge-colored graphs
• Some Theorems on Abstract Graphs

Cited in

(11)

• Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
• 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
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
• Cycle extension in edge-colored complete graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
• Rainbow vertex-pancyclicity of strongly edge-colored graphs
• Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124635)