Vertex colorings without rainbow subgraphs

DOI10.7151/DMGT.1896zbMath1350.05036OpenAlexW2401847924MaRDI QIDQ339490

Honghai Xu, Wayne Goddard

Publication date: 11 November 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1896

zbMATH Keywords

pathcoloringrainbow subgraphforbidden subgraphmonochromatic subgraph

Mathematics Subject Classification ID

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

Related Items (3)

Neighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ Coloring subgraphs with restricted amounts of hues ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths.

Cites Work

• Unnamed Item
• Unnamed Item
• Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
• Vertex coloring without large polychromatic stars
• Rainbow generalizations of Ramsey theory: A survey
• Avoiding rainbow induced subgraphs in vertex-colorings
• Maximum face-constrained coloring of plane graphs
• Signed domination in regular graphs
• Worm colorings
• 3-consecutive C-colorings of graphs
• Ramsey-type results for Gallai colorings
• Rainbow induced subgraphs in proper vertex colorings
• Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
• Edge colorings of complete graphs without tricolored triangles

This page was built for publication: Vertex colorings without rainbow subgraphs