Decomposing a planar graph of girth 5 into an independent set and a forest.

Ken-ichi Kawarabayashi Carsten Thomassen

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

Keyphrases

independent set
planar graphs
maximum weight
minimum weight
maximum independent set
bipartite graph
weighted graph
partition function
graphical models
lower bound
probabilistic model
upper bound
undirected graph
minimum spanning tree
greedy heuristic