COCO
2010
Springer
13 years 8 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
MFCS
2007
Springer
14 years 5 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...