Locally planar graphs are 5-paintable
From MaRDI portal
Publication:2346337
Recommendations
Cites work
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- Every planar graph is 5-choosable
- Five-coloring maps on surfaces
- Graph colorings with local constraints -- a survey
- Graph minors. VII: Disjoint paths on a surface
- List colourings of planar graphs
- Locally planar graphs are 5-choosable
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Three topics in online list coloring
Cited in
(8)- Every planar graph is 1-defective \((9,2)\)-paintable
- Locally planar graphs are 2-defective 4-paintable
- Locally planar graphs are 5-choosable
- Extending precolorings of subgraphs of locally planar graphs
- On-line DP-coloring of graphs
- scientific article; zbMATH DE number 1743975 (Why is no real title available?)
- Extending colorings of locally planar graphs
- Weak degeneracy of planar graphs and locally planar graphs
This page was built for publication: Locally planar graphs are 5-paintable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346337)