Planar graphs have two-coloring number at most 8

Zdenek Dvorák, Adam Kabela, Tomás Kaiser. Planar graphs have two-coloring number at most 8. Journal of Combinatorial Theory, Series A, 130:144-157, 2018. [doi]

Authors

Zdenek Dvorák

This author has not been identified. Look up 'Zdenek Dvorák' in Google

Adam Kabela

This author has not been identified. Look up 'Adam Kabela' in Google

Tomás Kaiser

This author has not been identified. Look up 'Tomás Kaiser' in Google