On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)

DOI10.1016/j.disc.2019.02.015zbMath1414.05096MaRDI QIDQ1999744

Yue Wang, Jian Liang Wu, Donglei Yang

Publication date: 27 June 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.02.015

zbMATH Keywords

cycle; planar graph; List coloring; choosability with separation

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs