Finding a subdivision of a digraph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2015

Finding a subdivision of a digraph


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.
Fichier principal
Vignette du fichier
subdivision.pdf (178.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01111374 , version 1 (23-10-2016)


  • HAL Id : hal-01111374 , version 1


Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia de Oliviera. Finding a subdivision of a digraph. Theoretical Computer Science, 2015, 562, pp.20. ⟨hal-01111374⟩
123 View
190 Download


Gmail Facebook Twitter LinkedIn More