Planar graphs without 3-, 7-, and 8-cycles are 3-choosable.

Zdenek Dvorák Bernard Lidický Riste Skrekovski

Published in: Discret. Math. (2009)

Keyphrases

planar graphs
approximate inference

special case
random walk

shortest path

weighted graph