5 citations · 12 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Powers of planar graphs, product structure, and blocking partitions
Marc Distel, Robert Hickingbotham, Michał T. Seweryn +1
We prove that the -power of any planar graph is contained in for some graph with bounded treewidth, some path , and some functio…
math.CO2023
Pathwidth vs cocircumference
Marcin Briański, Gwenaël Joret, Michał T. Seweryn
The {\em circumference} of a graph with at least one cycle is the length of a longest cycle in . A classic result of Birmelé (2003) states that the treewidth of is at mo…