Finding an induced subdivision of a digraph
Discrete Mathematics
2016-03-27 v1 Combinatorics
Abstract
We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) , does it contain an induced subdivision of a prescribed digraph ? The complexity of this problem depends on and on whether must be an oriented graph or is allowed to contain 2-cycles. We give a number of examples of polynomial instances as well as several NP-completeness proofs.
Cite
@article{arxiv.1309.1553,
title = {Finding an induced subdivision of a digraph},
author = {Jørgen Bang-Jensen and Frédéric Havet and Nicolas Trotignon},
journal= {arXiv preprint arXiv:1309.1553},
year = {2016}
}