48 citations · 133 across the 27 of their papers we have counts for
4 papers · 1 filter
Decomposing planar cubic graphs
Arthur Hoffmann-Ostenhof, Tomáš Kaiser, Kenta Ozeki
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture hol…
Nowhere-zero flows in signed graphs: A survey
Tomáš Kaiser, Edita Rollová, Robert Lukot'ka
We survey known results related to nowhere-zero flows and related topics, such as circuit covers and the structure of circuits of signed graphs. We include an overview of several d…
Schrijver graphs and projective quadrangulations
Tomáš Kaiser, Matěj Stehlík
In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the authors have extended the concept of quadrangulation of a surface to higher dimension, and showed that ever…
Treelike snarks
Marién Abreu, Tomas Kaiser, Domenico Labbate +1
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provide…