Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions

DOI10.1007/s40590-024-00645-0zbMATH Open1547.05072MaRDI QIDQ6602386

Rocío Sánchez-López, Hortensia Galeana-Śanchez, Felipe Hernández-Lorenzana

Publication date: 11 September 2024

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

zbMATH Keywords

edge-colored graph\(H\)-cycleproperly colored walk

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properly colored paths and cycles
• Using matrices to link conflict evolution and resolution in a graph model
• A matrix approach to status quo analysis in the graph model for conflict resolution
• Hamiltonian circuits determining the order of chromosomes
• A note on alternating cycles in edge-coloured graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• The theory of regular graphs
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• \(H\)-cycles in \(H\)-colored multigraphs
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Digraphs

This page was built for publication: Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions