Vertex colorings without rainbow subgraphs

DOI10.7151/DMGT.1896zbMATH Open1350.05036OpenAlexW2401847924MaRDI QIDQ339490FDOQ339490

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

Recommendations

• Vertex colorings without rainbow or monochromatic subgraphs
• Vertex coloring without large polychromatic stars
• scientific article; zbMATH DE number 434896
• Coloring subgraphs with restricted amounts of hues
• Subgraph-avoiding coloring of graphs

zbMATH Keywords

coloringpathrainbow subgraphforbidden subgraphmonochromatic subgraph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Complexity of Computing the Anti-Ramsey Numbers for Paths.
• Neighborhood-restricted \([\leq 2]\)-achromatic colorings
• Vertex coloring without large polychromatic stars
• The packing number of cubic graphs
• Coloring subgraphs with restricted amounts of hues
• Avoiding rainbow induced subgraphs in vertex-colorings

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

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