Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable

MaRDI QIDQ3428684zbMATH OpenFDO

Authors Haihui Zhang, Baogang Xu, Zhiren Sun

Publication date 29 March 2007

zbMATH Keywords

planar graphstriangle-free graphslist colouring

Mathematics Subject Classification ID

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

Recommendations

• On 3-choosability of plane graphs without 5-, 8- and 9-cycles
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
• The 3-choosability of special plane graphs with girth of 4 at least
• The 3-choosability of plane graphs without 8-, 9- and 10-cycles

Cited in

(16)

• \((4m,m)\)-choosability of plane graphs
• On (k, k n - k^2 - 2 k - 1)-choosability of n-vertex graphs
• On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
• The 3-choosability of special plane graphs with girth of 4 at least
• Choice numbers of multi-bridge graphs
• Choosability of the square of planar subcubic graphs with large girth
• 3-list-coloring planar graphs of girth 4
• The 3-choosability of plane graphs without 3-,6-,9-and 10-cycles
• Planar graphs with girth 20 are additively 3-choosable
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• On 3-choosability of plane graphs without 5-, 8- and 9-cycles
• On 3-choosability of planar graphs without certain cycles
• A note on group choosability of graphs with girth at least 4
• Choosability in signed planar graphs

This page was built for publication: Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable

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