Multiple list colouring of planar graphs

DOI10.1016/J.JCTB.2016.09.008MaRDI QIDQ345127zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

Publication date 25 November 2016

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.04690

zbMATH Keywords

fractional choice numbermultiple list colouringplanar graph

Mathematics Subject Classification ID

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

Abstract: This paper proves that for each positive integer $m$, there is a planar graph $G$ which is not $(4m+lfloorfrac2m-19floor,m)$-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.

Recommendations

• List colourings of planar graphs
• \((4m,m)\)-choosability of plane graphs
• List colourings of planar graphs. (Reprint)
• Choosability of planar graphs
• Every planar graph is 5-choosable

Cites work

• A (<5)-Colour Theorem for Planar Graphs
• A note on coloring vertex-transitive graphs
• Choosability and fractional chromatic numbers
• Every planar graph is 5-choosable
• scientific article; zbMATH DE number 986968 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 890665 (Why is no real title available?)
• List colourings of planar graphs
• The complexity of planar graph choosability

Cited in

(19)

• A note on not-4-list colorable planar graphs
• On list r-hued coloring of planar graphs
• Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
• A refinement of choosability of graphs
• The strong fractional choice number of series-parallel graphs
• Multiple list colouring triangle free planar graphs
• List (p,q)-coloring of sparse plane graphs
• On \(t\)-common list-colorings
• Dynamic coloring and list dynamic coloring of planar graphs
• Every planar graph is 1-defective \((9,2)\)-paintable
• List Colouring Squares of Planar Graphs
• On list-coloring outerplanar graphs
• Adapted list coloring of planar graphs
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
• The strong fractional choice number of 3‐choice‐critical graphs
• Multiple list coloring of 3‐choice critical graphs
• List 4-colouring of planar graphs
• List colourings of planar graphs
• On defective, multifold, online, list coloring of planar graphs via combinatorial nullstellensatz

This page was built for publication: Multiple list colouring of planar graphs

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