30 citations · 157 across the 83 of their papers we have counts for
5 papers · 2 filters
Plane Strong Connectivity Augmentation
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald +1
We investigate the problem of strong connectivity augmentation within plane oriented graphs. We show that deciding whether a plane oriented graph can be augmented with (any num…
Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A -colorful graph= is defined as a pair where is a…
The Local Structure Theorem for Graph Minors with finite index
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos +1
The Local Structure Theorem (LST) for Graph Minors roughly states that for every -minor-free graph that contains a sufficiently large wall , there is a small vertex subse…
Excluding Pinched Spheres
Laure Morelle, Evangelos Protopapas, Dimitrios M. Thilikos +1
The pinched sphere is the pseudo-surface obtained by identifying two distinct points of the sphere. We provide a structural characterization of graphs exclud…
Catching Rats in -minor-free Graphs
Maximilian Gorsky, Giannos Stamoulis, Dimitrios M. Thilikos +1
We show that every -minor-free graph that also excludes a -grid as a minor has treewidth/branchwidth bounded from above by a function that is linear in $k…