Star coloring planar graphs from small lists
From MaRDI portal
Publication:3553237
DOI10.1002/JGT.20431zbMATH Open1209.05090OpenAlexW4249707333MaRDI QIDQ3553237FDOQ3553237
Authors: André Kündgen, Craig Timmons
Publication date: 22 April 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20431
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (13)
- Star coloring bipartite planar graphs
- 8-star-choosability of a graph with maximum average degree less than 3
- On star 5-colorings of sparse graphs
- On the weak 2-coloring number of planar graphs
- I,F-partitions of sparse graphs
- Star coloring high girth planar graphs
- Coloring with no 2-colored \(P_4\)'s
- Injective edge-coloring of subcubic graphs
- 6-Star-Coloring of Subcubic Graphs
- Star list chromatic number of planar subcubic graphs
- Star coloring of graphs with girth at least five
- Representing graphs as the intersection of cographs and threshold graphs
- Star coloring outerplanar bipartite 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)