Arthur Hoffmann-Ostenhof

most citedA note on 5-cycle double covers

10 citations · 12 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2012★ 2 cited

Even Subdivision-Factors of Cubic Graphs

Arthur Hoffmann-Ostenhof

We call a set $S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of…

math.CO2012★ 10 cited

A note on 5-cycle double covers

Arthur Hoffmann-Ostenhof

The strong cycle double cover conjecture states that for every circuit $C$ of a bridgeless cubic graph $G$ , there is a cycle double cover of $G$ which contains $C$ . We conjecture t…

math.CO2012

Construction of Permutation Snarks

Jonas Hägglund, Arthur Hoffmann-Ostenhof

A permutation snark is a snark which has a 2-factor $F_{2}$ consisting of two chordless circuits; $F_{2}$ is called the permutation 2-factor of $G$ . We construct an infinite family $\m…