Characterizations and directed path-width of sequence digraphs (Q6038712): Difference between revisions

@@ Property / cites work @@
+Directed path-width of sequence digraphs
@@ Property / cites work: Directed path-width of sequence digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Word-Representable Graphs: a Survey
@@ Property / cites work: Word-Representable Graphs: a Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Computing directed pathwidth in \(O(1.89^n)\) time
+Normal rank
@@ Property / cites work @@
+Linear Layouts in Submodular Systems
@@ Property / cites work: Linear Layouts in Submodular Systems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Pathwidth of Almost Semicomplete Digraphs
@@ Property / cites work: On the Pathwidth of Almost Semicomplete Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the pathwidth of directed graphs with small vertex cover
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the FIFO stack-up problem
@@ Property / cites work: On the complexity of the FIFO stack-up problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5403747
@@ Property / cites work: Q5403747 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+On the pathwidth of chordal graphs
@@ Property / cites work: On the pathwidth of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Min Cut is NP-complete for edge weighted trees
@@ Property / cites work: Min Cut is NP-complete for edge weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Tournament immersion and cutwidth
@@ Property / cites work: Tournament immersion and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Digraph searching, directed vertex separation and directed pathwidth
+Normal rank
@@ Property / cites work @@
+A note on exact algorithms for vertex ordering problems on graphs
+Normal rank