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

DOI10.1007/S40590-024-00645-0MaRDI QIDQ6602386zbMATH OpenFDO

Authors Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocio Sanchez-Lopez

Publication date 11 September 2024

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

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
• Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
• \(H\)-cycles in \(H\)-colored multigraphs
• A generalization of properly colored paths and cycles in edge-colored graphs
• Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs

Cites work

• scientific article; zbMATH DE number 4134069 (Why is no real title available?)
• scientific article; zbMATH DE number 3722690 (Why is no real title available?)
• scientific article; zbMATH DE number 3455294 (Why is no real title available?)
• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)
• A matrix approach to status quo analysis in the graph model for conflict resolution
• A note on alternating cycles in edge-coloured graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Digraphs
• Graph theory with applications
• Hamiltonian circuits determining the order of chromosomes
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• Properly colored paths and cycles
• The orderly colored longest path problem -- a survey of applications and new algorithms
• The theory of regular graphs
• Using matrices to link conflict evolution and resolution in a graph model
• \(H\)-cycles in \(H\)-colored multigraphs

Cited in

(2)

• Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
• On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs

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

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