Join Our Newsletter

103 search results - page 1 / 21» Planar Cycle Covering Graphs |

CORR

2011

Springer

8 years 1 months ago
2011

Springer

We describe a new variational lower-bound on the minimum energy conﬁguration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...

WG

2010

Springer

8 years 4 months ago
2010

Springer

We consider the problem of ﬁnding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...

DM

2010

8 years 6 months ago
2010

We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...

Book

A well-written book about graph theory.

CORR

2006

Springer

8 years 6 months ago
2006

Springer

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...