Disjoint directed and undirected paths and cycles in digraphs
type: Item
instance of: scholarly article
title: Disjoint directed and undirected paths and cycles in digraphs
zbMATH Open document ID: 1176.68137
author: Matthias Kriesell
author: Jørgen Bang-Jensen
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5626980
zbMATH Keywords: disjoint paths in digraphs
zbMATH Keywords: subgraph homeomorphism problem
zbMATH Keywords: dichotomy result
zbMATH Keywords: mixed graphs
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.08.034
OpenAlex ID: W2075073335
cites work: Digraphs
cites work: On the problem of finding disjoint cycles and dicycles in a digraph
cites work: The directed subgraph homeomorphism problem
cites work: Q5530472
cites work: Q4273847
cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
cites work: Graph minors. XIII: The disjoint paths problem
DOI: 10.1016/J.TCS.2009.08.034
Recommended article: Disjoint directed cycles in directed graphs
Recommended article: Vertex-disjoint directed and undirected cycles in general digraphs
Recommended article: Arc-disjoint directed and undirected cycles in digraphs
Recommended article: Disjoint paths in acyclic digraphs
Recommended article: Disjoint \(A\)-paths in digraphs
Recommended article: Q4568185
Recommended article: Disjoint directed cycles with specified lengths in directed bipartite graphs
Recommended article: On digraphs with no two disjoint directed cycles
Recommended article: Disjoint Paths in Decomposable Digraphs
Recommended article: Edge-disjoint paths and cycles inn-edge-connected graphs
description: scientific article; zbMATH DE number 5626980