Wojciech Nadara

activity

20182026

most citedApproximating pathwidth for graphs of small treewidth

11 citations · 23 across the 16 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument

Romain Bourneuf, Jana Masaříková, Wojciech Nadara +1

For a fixed integer $t \geq 1$ , a ( $t$ -)long claw, denoted $S_{t, t, t}$ , is the unique tree with three leaves, each at distance exactly $t$ from the vertex of degree three. Majewski…

math.CO2019★ 2 cited

Jones' Conjecture in subcubic graphs

Marthe Bonamy, François Dross, Tomáš Masařík +3

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain $k + 1$ vertex-disjoint cycles, then it suffices to delete $2 k$ vertices to obta…