2 citations · 6 across the 22 of their papers we have counts for
7 papers · 1 filter
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…
Generating strongly 2-connected digraphs
Meike Hatzel, Stephan Kreutzer, Evangelos Protopapas +3
We prove that there exist four operations such that given any two strongly -connected digraphs and where is a butterfly-minor of , there exists a sequence $D_0,\d…
Branchwidth is (1,g)-self-dual
Georgios Kontogeorgiou, Alexandros Leivaditis, Kostas I. Psaromiligkos +2
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the b…
Combing a Linkage in an Annulus
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
A linkage in a graph of size is a subgraph of whose connected components are paths. The pattern of a linkage of size is the set of pairs formed by the e…
k-apices of minor-closed graph classes. I. Bounding the obstructions
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Let be a minor-closed graph class. We say that a graph is a -apex of if contains a set of at most vertices such that b…
Minor-Obstructions for Apex Sub-unicyclic Graphs
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +3
A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph is -apex sub-unicyclic if it can become sub-unicyclic by removing of its vertices. We…
Minor-Obstructions for Apex-Pseudoforests
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +2
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one o…