On-line 3-choosable planar graphs

DOI10.11650/TWJM/1500406598zbMath1242.05063OpenAlexW4233803874MaRDI QIDQ424603

Ting-Pang Chang, Xuding Zhu

Publication date: 4 June 2012

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/view/1818

zbMATH Keywords

triangle-freeplanar graphon-line list colouring

Mathematics Subject Classification ID

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

Related Items (3)

Every planar graph is 1-defective \((9,2)\)-paintable ⋮ Towards an on-line version of Ohba's conjecture ⋮ Choosability and paintability of the lexicographic product of graphs

This page was built for publication: On-line 3-choosable planar graphs