Elsevier

Theoretical Computer Science

Volume 562, 11 January 2015, Pages 283-303
Theoretical Computer Science

Finding a subdivision of a digraph

https://doi.org/10.1016/j.tcs.2014.10.004Get rights and content
Under an Elsevier user license
open archive

Abstract

We consider the following problem for oriented graphs and digraphs: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We give a number of examples of polynomial instances, several NP-completeness proofs as well as a number of conjectures and open problems.

Keywords

Oriented graphs
Subdivision
Linkage problem

Cited by (0)

1

Most of this work was done while J. Bang-Jensen visited Projet Coati, I3S (CNRS, UNSA) and INRIA, Sophia Antipolis whose hospitality and financial support is gratefully acknowledged.

2

Partly supported by ANR Blanc STINT and CAPES/Brazil.