Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs.

Luke Postle Robin Thomas

Published in: J. Comb. Theory, Ser. B (2015)

Keyphrases

planar graphs
max cut
computational complexity
three dimensional
minimum weight
bipartite graph
weighted graph
undirected graph