Thomas Jatschka

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2017★ 1 cited

Special Hist-Snarks

Arthur Hoffmann-Ostenhof, Thomas Jatschka

A Hist in a cubic graph $G$ is a spanning tree $T$ which has only vertices of degree three and one. A snark with a Hist is called a Hist-snark, see \cite{HO}. We present several co…

math.CO2017

Snarks with special spanning trees

Arthur Hoffmann-Ostenhof, Thomas Jatschka

Let $G$ be a cubic graph which has a decomposition into a spanning tree $T$ and a $2$ -regular subgraph $C$ , i.e. $E (T) \cup E (C) = E (G)$ and $E (T) \cap E (C) = \emptyset$ . We provid…