Deciding Clique-Width for Graphs of Bounded Tree-Width
From MaRDI portal
Publication:4435348
Recommendations
- scientific article; zbMATH DE number 1830724
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
- scientific article; zbMATH DE number 1696534
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
- On the OBDD size for graphs of bounded tree- and clique-width
- scientific article; zbMATH DE number 2044924
- On the Relationship Between Clique-Width and Treewidth
- Upper bounds to the clique width of graphs
- Approximating clique-width and branch-width
Cited in
(32)- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- On a disparity between relative cliquewidth and relative NLC-width
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Vertex cover meets scheduling
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Inductive computations on graphs defined by clique-width expressions
- Treewidth versus clique number in graph classes with a forbidden structure
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Constrained-path labellings on graphs of bounded clique-width
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Query efficient implementation of graphs of bounded clique-width
- Directed NLC-width
- Vertex disjoint paths on clique-width bounded graphs
- Structure and algorithms for (cap, even hole)-free graphs
- From tree-decompositions to clique-width terms
- Counting truth assignments of formulas of bounded tree-width or clique-width
- On quasi-planar graphs: clique-width and logical description
- On the relationship between NLC-width and linear NLC-width
- The relative clique-width of a graph
- Computing the clique-width of cactus graphs
- Graph operations characterizing rank-width
- The behavior of clique-width under graph operations and graph transformations
- Approximating clique-width and branch-width
- Regular independent sets
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- Linear layouts measuring neighbourhoods in graphs
- Line graphs of bounded clique-width
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
This page was built for publication: Deciding Clique-Width for Graphs of Bounded Tree-Width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435348)
