Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
From MaRDI portal
Publication:3553229
Recommendations
Cites work
- scientific article; zbMATH DE number 2230310 (Why is no real title available?)
- Coloring face-hypergraphs of graphs on surfaces
- Disconnected 2-factors in planar cubic bridgeless graphs
- Gaps in the chromatic spectrum of face-constrained plane graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Looseness ranges of triangulations on closed surfaces
- Maximum face-constrained coloring of plane graphs
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- On rainbowness of semiregular polyhedra
- On the minimum size of tight hypergraphs
- Rainbowness of cubic plane graphs
- Tight and untight triangulations of surfaces by complete graphs
Cited in
(13)- Distinguishing colorings of 3-connected planar graphs with five colors
- Planar anti-Ramsey numbers of matchings
- Rainbow faces in edge-colored plane graphs
- Matchings and nonrainbow colorings
- Planar anti-Ramsey numbers of paths and cycles
- Vertex colorings without rainbow subgraphs
- Null and non-rainbow colorings of projective plane and sphere triangulations
- Facially-constrained colorings of plane graphs: a survey
- Colorings of planar graphs with no rainbow faces
- Facial rainbow coloring of plane graphs
- Proper colorings of plane quadrangulations without rainbow faces
- Colouring vertices of plane graphs under restrictions given by faces
- Rainbowness of plane graphs
This page was built for publication: Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553229)