12 citations · 46 across the 17 of their papers we have counts for
3 papers · 1 filter
Comparing Width Parameters on Graph Classes
Nick Brettell, Andrea Munaro, Daniël Paulusma +1
We study how the relationship between non-equivalent width parameters changes once we restrict to some special graph class. As width parameters, we consider treewidth, clique-width…
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
Esther Galby, Andrea Munaro, Shizhou Yang
We investigate a relaxation of the notion of treewidth-fragility, namely tree-independence-number-fragility. In particular, we obtain polynomial-time approximation schemes for inde…
Non-empty intersection of longest paths in -free graphs
James A. Long, Kevin G. Milans, Andrea Munaro
We make progress toward a characterization of the graphs such that every connected -free graph has a longest path transversal of size . In particular, we show that the gr…