10 citations · 14 across the 14 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Long paths and toughness of k-trees and chordal planar graphs
Adam Kabela
We show that every -tree of toughness greater than is Hamilton-connected for . (In particular, chordal planar graphs of toughness greater than are Ha…
math.CO2017★ 1 cited
An update on non-Hamiltonian -tough maximal planar graphs
Adam Kabela
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of -tough maximal planar graphs pr…