On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles

zbMATH Open1199.05134MaRDI QIDQ3640752FDOQ3640752

Authors: Cui-Qi Wang, Zhengke Miao 

Publication date: 11 November 2009

Recommendations

• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• On 3-choosability of plane graphs without 5-, 8- and 9-cycles
• Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable
• The 3-choosability of plane graphs without 8-, 9- and 10-cycles
• The 3-choosability of special plane graphs with girth of 4 at least

zbMATH Keywords

choosabilitycyclegirthplane graphEuler's formula

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (11)

• The 3-choosability of plane graphs without 8-, 9- and 10-cycles
• Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable
• The 3-choosability of plane graphs of girth 4
• The 3-choosability of special plane graphs with girth of 4 at least
• The 3-choosability of plane graphs without 3-,6-,9-and 10-cycles
• On 3-choosable planar graphs of girth at least 4
• An alternative approach for bounding the additive choice number of planar graphs
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
• On 3-choosability of plane graphs without 5-, 8- and 9-cycles
• Acyclic 3-choosability of sparse graphs with girth at least 7

This page was built for publication: On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles

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