Multiple list colouring triangle free planar graphs

DOI10.1016/J.JCTB.2018.12.004MaRDI QIDQ2312604zbMATH OpenOpenAlexWikidataFDO

Authors Yiting Jiang, Xuding Zhu

Publication date 17 July 2019

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

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

zbMATH Keywords

fractional choice numbermultiple list colouringstrong fractional choice numbertriangle free planar graphs

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 triangle-free planar graph $G$ which is not $(3m+lceilfracm17ceil-1,m)$-choosable.

Cites work

• A 4-choosable graph that is not \((8:2)\)-choosable
• A not 3-choosable planar graph without 3-cycles
• A note on the not 3-choosability of some families of planar graphs
• A short list color proof of Grötzsch's theorem
• Choosability and fractional chromatic numbers
• Fractional coloring of triangle-free planar graphs
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• Multiple list colouring of planar graphs
• Smaller planar triangle-free graphs that are not 3-list-colorable

Cited in

(6)

• Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
• The strong fractional choice number of series-parallel graphs
• List coloring triangle-free hypergraphs
• 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

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

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