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

DOI10.1016/J.DISC.2019.02.015zbMath1414.05096OpenAlexW2921364534MaRDI QIDQ1999744

Donglei Yang, Yue Wang, Jian Liang Wu

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

cycleplanar graphList coloringchoosability with separation

Mathematics Subject Classification ID

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

Related Items (1)

List 4-colouring of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• On choosability with separation of planar graphs without adjacent short cycles
• Every planar graph is 5-choosable
• A sufficient condition for planar graphs to be (3,1)-choosable
• A not 3-choosable planar graph without 3-cycles
• \((4,2)\)-choosability of planar graphs with forbidden structures
• On Choosability with Separation of Planar Graphs with Forbidden Cycles
• Brooks-type theorems for choosability with separation

This page was built for publication: On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)