Planar graphs without chordal 6-cycles are 4-choosable.

Daiqiang Hu Danjun Huang Weifan Wang Jian-Liang Wu

Published in: Discret. Appl. Math. (2018)

Keyphrases

planar graphs
undirected graph
approximation algorithms
approximate inference
spanning tree
boundary points
special case
higher order
directed acyclic graph
minimum cost