Mixed searching and proper-path-width
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4173000 (Why is no real title available?)
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 219268 (Why is no real title available?)
- Complexity of Finding Embeddings in a k-Tree
- Graph minors. I. Excluding a forest
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Interval graphs and searching
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Mixed searching and proper-path-width
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- Searching and pebbling
- The NP-completeness column: An ongoing guide
- The complexity of searching a graph
Cited in
(29)- Graph Searching in a Crime Wave
- Mixed searching and proper-path-width
- Algorithms and obstructions for linear-width and related search parameters
- Edge search number of cographs
- On the monotonicity of games generated by symmetric submodular functions.
- On the Cooperative Graph Searching Problem
- Throttling for zero forcing and variants
- Searching for Differential Paths in MD4
- Parameterized orientable deletion
- Mixed search number and linear-width of interval and split graphs
- Lower bounds for protrusion replacement by counting equivalence classes
- Minimum dominating set of queens: a trivial programming exercise?
- Embeddings of \(k\)-connected graphs of pathwidth \(k\)
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- On the parameterized complexity of \([1,j]\)-domination problems
- On the Parameterized Complexity of [1,j]-Domination Problems
- A partial k-arboretum of graphs with bounded treewidth
- An annotated bibliography on guaranteed graph searching
- Finding small-width connected path decompositions in polynomial time
- scientific article; zbMATH DE number 176249 (Why is no real title available?)
- Structurally parameterized \(d\)-scattered set
- Mixed Search Number of Permutation Graphs
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Pure Nash equilibria in graphical games and treewidth
- Edge Search Number of Cographs in Linear Time
- The mixed search game against an agile and visible fugitive is monotone
- Contraction obstructions for connected graph searching
- Strong-mixed searching and pathwidth
- Searching for a Visible, Lazy Fugitive
This page was built for publication: Mixed searching and proper-path-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674341)
