1 citations · 1 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
On Strict Brambles
Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos +1
A strict bramble of a graph is a collection of pairwise-intersecting connected subgraphs of The order of a strict bramble is the minimum size of a set of vertic…
Contraction Obstructions for Connected Graph Searching
Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos +1
We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded conne…