scientific article; zbMATH DE number 5983740

zbMATH Open1283.05113MaRDI QIDQ3099255FDOQ3099255

Authors: Qian Wu, Yingqian Wang 

Publication date: 1 December 2011

Title of this publication is not available (Why is that?)

Recommendations

• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable
• The 3-choosability of plane graphs without 8-, 9- and 10-cycles
• Planar graphs without triangular 4-cycles are 3-choosable
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• A non-3-choosable planar graph without cycles of length 4 and 5

zbMATH Keywords

choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• DP-3-coloring of planar graphs without certain cycles

This page was built for publication:

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