Colored graphs without colorful cycles

DOI10.1007/s00493-007-2224-6zbMath1174.05041arXiv1509.05621OpenAlexW2036460087MaRDI QIDQ949751

Petr Vojtěchovskí, Richard N. Ball, Ales Pultr

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05621

zbMATH Keywords

homomorphismmonoidrainbow colouringGallai graphcolourful cycle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (10)

Extensions of Gallai-Ramsey results ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Complete edge-colored permutation graphs ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ A decomposition of Gallai multigraphs ⋮ Gallai colorings and domination in multipartite digraphs ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Connected colourings of complete graphs and hypergraphs ⋮ Periods in missing lengths of rainbow cycles ⋮ Dualities in full homomorphisms

Cites Work

• Unnamed Item
• Edge-colored complete graphs with precisely colored subgraphs
• On lengths of rainbow cycles
• On classes of relations and graphs determined by subobjects and factorobjects
• Lambda composition
• Edge colorings of complete graphs without tricolored triangles
• Transitiv orientierbare Graphen

This page was built for publication: Colored graphs without colorful cycles