scientific article; zbMATH DE number 5917571
From MaRDI portal
Publication:3012402
\(W[1\)-hardness]general factorsgeneralized satisfiabilitygraph coloringminimum maximum outdegree orientationstreewidth
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- scientific article; zbMATH DE number 4081531
- Easy problems for tree-decomposable graphs
- Some results on tree decomposition of graphs
- A note on the tree decompositions of graphs
- scientific article; zbMATH DE number 866654
- Tree decompositions for a class of graphs
- Decompositions of graphs into trees
- Decomposition of complete graphs into arbitrary trees
- Tree decompositions of multigraphs
- Tree decompositions of graphs without large bipartite holes
Cited in
(15)- Defensive alliances in graphs of bounded treewidth
- Matchings with lower quotas: algorithms and complexity
- On the harmless set problem parameterized by treewidth
- Parameterized orientable deletion
- Complexity and approximability of parameterized MAX-CSPs
- Grundy Distinguishes Treewidth from Pathwidth
- Grundy distinguishes treewidth from pathwidth
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Problems hard for treewidth but easy for stable gonality
- Extended MSO model checking via small vertex integrity
- On the complexity of problems on tree-structured graphs
- Complexity of secure sets
- On parameterized complexity of liquid democracy
- The balanced satisfactory partition problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012402)
