On planar graphs without list 3-coloring

zbMATH Open1299.05133MaRDI QIDQ2454454

V. A. Tashkinov

Publication date: 13 June 2014

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v5/p685-690.pdf

zbMATH Keywords

planar graphlist coloring3-choosability

Mathematics Subject Classification ID

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

Related Items (1)

Three-coloring and list three-coloring of graphs without induced paths on seven vertices

This page was built for publication: On planar graphs without list 3-coloring

Report a bugQ2454454