93,211 research outputs found
On the Complexity of the Mis\`ere Version of Three Games Played on Graphs
We investigate the complexity of finding a winning strategy for the mis\`ere
version of three games played on graphs : two variants of the game
, introduced by Stockmann in 2004 and the game on both directed and undirected graphs. We show that on general
graphs those three games are -Hard or Complete. For one
-Hard variant of , we find an algorithm to compute
an effective winning strategy in time when
is a bipartite graph
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
Bounded expansion and nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of uniformly sparse graphs which includes the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs. Since their initial definition it was shown that these graph classes can be defined in many equivalent ways: by generalised colouring numbers, neighbourhood complexity, sparse neighbourhood covers, a game known as the splitter game, and many more.
We study the corresponding concepts for directed graphs. We show that the densities of bounded depth directed minors and bounded depth topological minors relate in a similar way as in the undirected case. We provide a characterisation of bounded expansion classes by a directed version of the generalised colouring numbers. As an application we show how to construct sparse directed neighbourhood covers and how to approximate directed distance-r dominating sets on classes of bounded expansion. On the other hand, we show that linear neighbourhood complexity does not characterise directed classes of bounded expansion
- …