The following pages link to Directed NLC-width (Q906393):
Displaying 15 items.
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
