Directed cycle double covers: hexagon graphs
Andrea Jiménez, Mihyun Kang, Martin Loebl · Scuola Normale Superiore eBooks · 2013
Jaeger’s directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. A hexagon graph can be associated with any cubic graph. We show that the hexagon graphs of cubic bridgeless graphs are braces that can be generated from the ladder on 8 vertices using two types of McCuaig’s augmentations.