Pages that link to "Item:Q1974445"
From MaRDI portal
The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):
Displaying 50 items.
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- Directed NLC-width (Q906393) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Graph decomposition of slim graphs (Q1288512) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Notes on complexity of packing coloring (Q1641149) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Reasoning about integrity constraints for tree-structured data (Q1650919) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
