The use of Euler's formula in (3,1)*-list-coloring

DOI10.7151/DMGT.1304MaRDI QIDQ5492689zbMATH OpenOpenAlexFDO

Authors Yongqiang Zhao, Wenjie He

Publication date 16 October 2006

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1304

zbMATH Keywords

\((L,d)^*\)-colouring\((m,d)^*\)-choosablelist improper colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On 3-choosability of planar graphs without certain cycles
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• (4,1)^*-choosability of planar graphs
• scientific article; zbMATH DE number 6873968

This page was built for publication: The use of Euler's formula in (3,1)*-list-coloring

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