Star coloring planar graphs from small lists
From MaRDI portal
Publication:3553237
Recommendations
Cites work
Cited in
(13)- On the weak 2-coloring number of planar graphs
- Injective edge-coloring of subcubic graphs
- Star coloring of graphs with girth at least five
- 6-Star-Coloring of Subcubic Graphs
- On star 5-colorings of sparse graphs
- 8-star-choosability of a graph with maximum average degree less than 3
- Representing graphs as the intersection of cographs and threshold graphs
- Star coloring high girth planar graphs
- Coloring with no 2-colored \(P_4\)'s
- Star list chromatic number of planar subcubic graphs
- Star coloring outerplanar bipartite graphs
- Star coloring bipartite planar graphs
- I,F-partitions of sparse graphs
This page was built for publication: Star coloring planar graphs from small lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553237)