A note on 3-choosability of plane graphs under distance restrictions

DOI10.1142/S1793830917500112zbMath1358.05079OpenAlexW2562711669MaRDI QIDQ2966511

Yiming Wei, Jing Jin

Publication date: 7 March 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500112

zbMATH Keywords

distanceplane graph3-choosable

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (5)

Optimal channel assignment and \(L(p,1)\)-labeling ⋮ 3-Paintability of planar graphs ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ Minimum 2-distance coloring of planar graphs and channel assignment

Cites Work

• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• A non-3-choosable planar graph without cycles of length 4 and 5
• A relaxation of Havel's 3-color problem
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Colorings of plane graphs: a survey
• Bordeaux 3-color conjecture and 3-choosability
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

This page was built for publication: A note on 3-choosability of plane graphs under distance restrictions