10 citations · 19 across the 18 of their papers we have counts for
Showing 2017 · math.COShow all
2 papers · 2 filters
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…
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…