scientific article; zbMATH DE number 6873968

MaRDI QIDQ4642877zbMATH OpenFDO

Authors Yuehua Bu, Caixia Fu, Junlei Zhu

Publication date 25 May 2018

zbMATH Keywords

list coloringcyclesplanar graphsimproper coloring

Mathematics Subject Classification ID

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

Recommendations

• A \((3,1)^\ast\)-choosable theorem on planar graphs
• On \((3, r)\)-choosability of some planar graphs
• On 3-choosability of triangle-free plane graphs
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs
• A note on 3-choosability of planar graphs
• A sufficient condition for planar graphs to be (3,1)-choosable
• A note on 3-choosability of plane graphs under distance restrictions
• Some structural properties of planar graphs and their applications to 3-choosability
• The entire choosability of plane graphs

Cited in

(6)

• (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• The result on \((3,1)^\ast \)-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.
• The use of Euler's formula in (3,1)*-list-coloring
• Improper choosability of planar graphs without 6-circuits

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 Q4642877)