On 3-choosability of triangle-free plane graphs

DOI10.1007/S11425-011-4191-ZMaRDI QIDQ657261zbMATH OpenOpenAlexFDO

Authors Yingqian Wang, Qijun Zhang

Publication date 16 January 2012

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-011-4191-z

zbMATH Keywords

trianglechoosabilitycycleplane graphcoloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• 3-choosability of triangle-free planar graphs with constraints on 4-cycles
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
• scientific article; zbMATH DE number 6671710
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• Planar graphs without triangular 4-cycles are 3-choosable

Cites work

• A not 3-choosable planar graph without 3-cycles
• A short list color proof of Grötzsch's theorem
• Colorings and orientations of graphs
• On 3-choosable planar graphs of girth at least 4

Cited in

(10)

• scientific article; zbMATH DE number 5914884 (Why is no real title available?)
• scientific article; zbMATH DE number 6873968 (Why is no real title available?)
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• scientific article; zbMATH DE number 5064026 (Why is no real title available?)
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
• Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable
• 3-choosability of triangle-free planar graphs with constraints on 4-cycles
• General parity result and cycle-plus-triangles graphs
• Note on 3-choosability of planar graphs with maximum degree 4
• scientific article; zbMATH DE number 6671710 (Why is no real title available?)

This page was built for publication: On 3-choosability of triangle-free plane graphs

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