Thick forests
From MaRDI portal
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for unipolar and generalized split graphs
- An introduction to clique minimal separator decomposition
- Clique-cutsets beyond chordal graphs
- Complexity of Finding Embeddings in a k-Tree
- Computing the Minimum Fill-In is NP-Complete
- Counting independent sets in graphs with bounded bipartite pathwidth
- Counting weighted independent sets beyond the permanent
- Decomposition by clique separators
- Detecting an Odd Hole
- Dichotomy for tree-structured trigraph list homomorphism problems
- Disjoint clique cutsets in graphs without long holes
- Generalized partitions of graphs
- Geometric algorithms and combinatorial optimization.
- Geometric versions of the three-dimensional assignment problem under general norms
- Graph Subcolorings: Complexity and Algorithms
- scientific article; zbMATH DE number 3977053 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- Matrix partitions of perfect graphs
- More about subcolorings
- Normal hypergraphs and the perfect graph conjecture
- On 2-Subcolourings of Chordal Graphs
- On chordal graphs and their chromatic polynomials
- On the complexity of finding a sun in a graph
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
- Parameterized complexity: the main ideas and connections to practical computing
- Recent developments on graphs of bounded clique-width
- Recognition of unipolar and generalised split graphs
- The complexity of computing the permanent
- The complexity of generalized graph colorings
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The relative complexity of approximate counting problems
- The strong perfect graph theorem
- The subchromatic number of a graph
- Treewidth. Computations and approximations
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
This page was built for publication: Thick forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848841)
