Pages that link to "Item:Q5317177"
From MaRDI portal
The following pages link to On the Relationship Between Clique-Width and Treewidth (Q5317177):
Displaying 50 items.
- Regular independent sets (Q260019) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
