Multiple list colouring triangle-free planar graphs
classification
🧮 math.CO
keywords
planartriangle-freechoosablecolouringfracgraphgraphsinteger
read the original abstract
This paper proves that for each positive integer $m$, there is a triangle-free planar graph $G$ which is not $(3m+ \lceil \frac m{17} \rceil-1, m)$-choosable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.