Recommendations
Cites work
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- 3-consecutive C-colorings of graphs
- Avoiding rainbow induced subgraphs in vertex-colorings
- Edge colorings of complete graphs without tricolored triangles
- Maximum face-constrained coloring of plane graphs
- Non-monochromatic non-rainbow colourings of -hypergraphs
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
- Rainbow generalizations of Ramsey theory: A survey
- Rainbow induced subgraphs in proper vertex colorings
- Ramsey-type results for Gallai colorings
- Signed domination in regular graphs
- Vertex coloring without large polychromatic stars
- WORM colorings forbidding cycles or cliques
- Worm colorings
Cited in
(7)- 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
- Vertex colorings without rainbow or monochromatic subgraphs
- 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)
