Null and non-rainbow colorings of projective plane and sphere triangulations
From MaRDI portal
(Redirected from Publication:299082)
Abstract: For maximal planar graphs of order , we prove that a vertex--coloring containing no rainbow faces uses at most colors, and this is best possible. For maximal graph embedded on the projective plane, we obtain the analogous best bound . The main ingredients in the proofs are classical homological tools. By considering graphs as topological spaces, we introduce the notion of a null coloring, and prove that for any graph a maximal null coloring is such that the quotient graph is a forest.
Recommendations
Cites work
- Colorings of planar graphs with no rainbow faces
- Graphs, surfaces and homology
- Looseness ranges of triangulations on closed surfaces
- Maximum face-constrained coloring of plane graphs
- On the minimum size of tight hypergraphs
- Rainbowness of cubic plane graphs
- Tight and untight triangulations of surfaces by complete graphs
Cited in
(1)
This page was built for publication: Null and non-rainbow colorings of projective plane and sphere triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299082)