Directed path-width and directed tree-width of directed co-graphs
From MaRDI portal
Recommendations
Cited in
(18)- Oriented coloring on recursively defined digraphs
- On characterizations for subclasses of directed co-graphs
- The knapsack problem with special neighbor constraints
- Computing directed Steiner path covers
- Characterizations for special directed co-graphs
- Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
- Solutions for subset sum problems with special digraph constraints
- How to compute digraph width measures on directed co-graphs
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Computing digraph width measures on directed co-graphs (extended abstract)
- Comparing linear width parameters for directed graphs
- Directed path-width of sequence digraphs
- Computing directed Steiner path covers for directed co-graphs (extended abstract)
- Directed one-trees
- A graph theoretic approach to solve special knapsack problems in polynomial time
- Directed path-decompositions
- Characterizations and directed path-width of sequence digraphs
- Computing directed path-width and directed tree-width of recursively defined digraphs
This page was built for publication: Directed path-width and directed tree-width of directed co-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790979)