Sciweavers

Share
103 search results - page 1 / 21
» Planar Cycle Covering Graphs
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
8 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
WG
2010
Springer
8 years 4 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding 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...
Ge Xia, Yong Zhang
DM
2010
131views more  DM 2010»
8 years 6 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
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...
Oleg V. Borodin, Mickaël Montassier, Andr&eac...

Book
1174views
10 years 4 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel
CORR
2006
Springer
164views Education» more  CORR 2006»
8 years 6 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
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 ...
Bodo Manthey
books