R. Häggkvist

collaborators

2 papers

math.CO2017

Cycle Double Covers via Kotzig Graphs

Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof

We show that every $2$ -connected cubic graph $G$ has a cycle double cover if $G$ has a spanning subgraph $F$ such that (i) every component of $F$ has an even number of vertices (ii…

math.CO2004

Orthogonal latin rectangles

Roland Häggkvist, Anders Johansson

We use a greedy probabilistic method to prove that for every $ε > 0$ , every $m \times n$ Latin rectangle on $n$ symbols has an orthogonal mate, where $m = (1 - ε) n$ . That is, we show the…