2 papers
cs.DM2018
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs
Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph contains a cactus subgraph where c…
cs.DS2017
Computing Tutte Paths
Andreas Schmid, Jens M. Schmidt
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs i…