Minimum choosability of planar graphs

DOI10.1007/S10878-018-0280-ZzbMATH Open1441.05064OpenAlexW2790022965MaRDI QIDQ724728FDOQ724728

Authors: Bin Liu, Ling Gai, Huijuan Wang, Hongwei Du, Jian-Liang Wu 

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

Recommendations

• A note on the minimum number of choosability of planar graphs
• The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
• List edge coloring of planar graphs without 6-cycles with two chords
• Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
• List-edge-coloring of planar graphs without 6-cycles with three chords

zbMATH Keywords

list coloringchoosabilityplanar graphchordal

Mathematics Subject Classification ID

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

Cites Work

• 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
• A note on the minimum number of choosability of planar graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Minimum total coloring of planar graph
• Title not available (Why is that?)
• 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

Cited In (10)

• Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
• A note on the minimum number of choosability of planar graphs
• Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable
• Path choosability of planar graphs
• Choosability of planar graphs
• The list linear arboricity of planar graphs with 7-cycles containing at most two chords
• \(k\)-frugal list coloring of planar graphs without small cycles
• The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
• 2-distance choosability of planar graphs with a restriction for maximum degree
• Optimal \(r\)-dynamic coloring of sparse graphs

This page was built for publication: Minimum choosability of planar graphs

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