Locally planar graphs are 5-paintable
From MaRDI portal
Publication:2346337
DOI10.1016/J.DISC.2014.11.015zbMATH Open1314.05048OpenAlexW2078920892MaRDI QIDQ2346337FDOQ2346337
Authors: Ming Han, Xuding Zhu
Publication date: 1 June 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.11.015
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Mr. Paint and Mrs. Correct
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- Graph colorings with local constraints -- a survey
- On-line list colouring of graphs
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- List colourings of planar graphs
- Graph minors. VII: Disjoint paths on a surface
- Locally planar graphs are 5-choosable
- 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
- Title not available (Why is that?)
- 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)