25 citations · 38 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CG2016
Arc diagrams, flip distances, and Hamiltonian triangulations
Jean Cardinal, Michael Hoffmann, Vincent Kusters +2
We show that every triangulation (maximal planar graph) on vertices can be flipped into a Hamiltonian triangulation using a sequence of less than combinatorial edge…
cs.CG2016★ 1 cited
The Planar Tree Packing Theorem
Markus Geyer, Michael Hoffmann, Michael Kaufmann +2
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing…