The following pages link to (Q4734761):
Displaying 41 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- PLA folding in special graph classes (Q1329804) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- The Firefighter Problem: A Structural Analysis (Q2946017) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- The pathwidth and treewidth of cographs (Q5056112) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- On the linear arboricity of graphs with treewidth at most four (Q6172210) (← links)
