On 3-choosability of triangle-free plane graphs

DOI10.1007/S11425-011-4191-ZzbMATH Open1228.05160OpenAlexW2000960231MaRDI QIDQ657261FDOQ657261

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

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
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• Planar graphs without triangular 4-cycles are 3-choosable

zbMATH Keywords

trianglechoosabilitycycleplane graphcoloring

Mathematics Subject Classification ID

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

Cites Work

• 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
• A not 3-choosable planar graph without 3-cycles

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
• 3-choosability of triangle-free planar graphs with constraints on 4-cycles

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)