Fast 3-coloring triangle-free planar graphs
From MaRDI portal
Recommendations
Cited in
(16)- 3-dynamic coloring of planar triangulations
- Fast 3-coloring triangle-free planar graphs
- Efficient reassembling of three-regular planar graphs
- Do triangle-free planar graphs have exponentially many 3-colorings?
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings
- Sub-exponentially many 3-colorings of triangle-free planar graphs
- Three-coloring triangle-free planar graphs in linear time
- From the plane to higher surfaces
- Three-coloring triangle-free planar graphs in linear time
- Triangulating Three-Colored Graphs in Linear Time and Linear Space
- Improved dynamic graph coloring
- Sub-exponentially many 3-colorings of triangle-free planar graphs
- Adjacency queries in dynamic sparse graphs
- Many 3-colorings of triangle-free planar graphs
- Fractional coloring of triangle-free planar graphs
This page was built for publication: Fast 3-coloring triangle-free planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464602)