3-paintability of planar graphs

DOI10.1142/S1793830918500672MaRDI QIDQ4554554zbMATH OpenWikidataFDO

Authors Huihui Yan, Hao Qi

Publication date 14 November 2018

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

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

zbMATH Keywords

3-paintabledistanceplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• On 3-choosability of planar graphs without certain cycles
• A note on 3-choosability of planar graphs
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
• Planar graphs without 4, 6, 8-cycles are 3-colorable

Cites work

• A note on 3-choosability of plane graphs under distance restrictions
• A note on the not 3-choosability of some families of planar graphs
• Colorings and orientations of graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Mr. Paint and Mrs. Correct
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Steinberg's conjecture is false

Cited in

(3)

• Defective 3-paintability of planar graphs
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• scientific article; zbMATH DE number 1743975 (Why is no real title available?)

This page was built for publication: 3-paintability of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554554)