On the pathwidth of chordal graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4121438 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A characterisation of rigid circuit graphs
- Complexity of Finding Embeddings in a k-Tree
- Easy problems for tree-decomposable graphs
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Interval graphs and searching
- Min Cut is NP-complete for edge weighted trees
- Reducibility among combinatorial problems
- Searching and pebbling
- The NP-completeness column: An ongoing guide
- The complexity of searching a graph
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The pathwidth and treewidth of cographs
Cited in
(42)- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Triangulating graphs without asteroidal triples
- Dominoes
- The complexity of minimum-length path decompositions
- Approximate search strategies for weighted trees
- Well-partitioned chordal graphs
- Characterizations and directed path-width of sequence digraphs
- Pathwidth is NP-Hard for Weighted Trees
- Vertex deletion problems on chordal graphs
- Exclusive graph searching vs. pathwidth
- Graph searching on chordal graphs
- Edge search number of cographs
- Minimal interval completion through graph exploration
- Homotopy height, grid-major height and graph-drawing height
- Treewidth for graphs with small chordality
- Pathwidth of Circular-Arc Graphs
- Multicore graphs: characterization and properties
- Approximating Pathwidth for Graphs of Small Treewidth
- Three-fast-searchable graphs
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- How to compute digraph width measures on directed co-graphs
- Connected graph searching in chordal graphs
- Pursuing a fast robber on a graph
- Mixed search number and linear-width of interval and split graphs
- On the interval completion of chordal graphs
- Corrigendum to: ``On the monophonic rank of a graph
- Edge and node searching problems on trees
- Complexity of approximating the oriented diameter of chordal graphs
- The complexity of zero-visibility cops and robber
- Vertex deletion problems on chordal graphs
- Mixed Search Number of Permutation Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Variable neighborhood search for the vertex separation problem
- Node-searching problem on block graphs
- Edge Search Number of Cographs in Linear Time
- On tradeoffs between width- and fill-like graph parameters
- Computing directed pathwidth in \(O(1.89^n)\) time
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Non-deterministic graph searching in trees
- Treewidth and pathwidth of permutation graphs
- On the monophonic rank of a graph
This page was built for publication: On the pathwidth of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309811)
