Minimum choosability of planar graphs

DOI10.1007/s10878-018-0280-zzbMath1441.05064OpenAlexW2790022965MaRDI QIDQ724728

Ling Gai, Bin Liu, Jian Liang Wu, Hongwei David Du, Hui-Juan Wang

Publication date: 26 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0280-z

zbMATH Keywords

planar graphchoosabilitylist coloringchordal

Mathematics Subject Classification ID

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

Related Items

Optimal \(r\)-dynamic coloring of sparse graphs

Cites Work

• Unnamed Item
• A note on the minimum number of choosability of planar graphs
• Minimum total coloring of planar graph
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• List edge and list total colorings of planar graphs without 4-cycles
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• List edge and list total colourings of multigraphs
• Coloring of double disk graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs