Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs

DOI10.1016/j.dam.2021.10.016zbMath1481.05056OpenAlexW3212087973MaRDI QIDQ2057600

Fangfang Wu, Tingting Han, Bin Long Li, Sheng Gui Zhang

Publication date: 7 December 2021

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

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

zbMATH Keywords

color neighborhoodedge-colored complete graphsproperly colored cyclesproperly colored paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properly colored paths and cycles
• Circuits through specified edges
• Cycles through specified vertices of a graph
• Alternating Hamiltonian cycles
• Circuits containing specified edges
• Vertex pancyclic graphs
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Cycle extension in edge-colored complete graphs
• On sufficient conditions for rainbow cycles in edge-colored graphs
• Pancyclic graphs. I
• Pancyclic and Bipancyclic Graphs
• 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

This page was built for publication: Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs