Edge-disjoint odd cycles in planar graphs.

Daniel Král Heinz-Jürgen Voss

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

Keyphrases

planar graphs
edge disjoint
spanning tree
minimum weight
total length
undirected graph
minimum spanning tree
weighted graph
minimum cost
bayesian networks
linear programming
probability distribution
higher order
bipartite graph
approximate inference