The following pages link to Clique-Width is NP-Complete (Q3563951):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← 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)
- Clique-width with an inactive label (Q465271) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Directed NLC-width (Q906393) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5002765) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- (Q5089227) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
