10 citations · 19 across the 18 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 2 cited
Longer Cycles in Essentially 4-Connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar 3-connected graph is called \emph{essentially -connected} if, for every 3-separator , at least one of the two components of is an isolated vertex. Jackson…
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…
math.CO2017
Cut Tree Structures with Applications on Contraction-Based Sparsification
On-Hei Solomon Lo, Jens M. Schmidt
We introduce three new cut tree structures of graphs in which the vertex set of the tree is a partition of and contractions of tree vertices satisfy sparsification requi…