The following pages link to (Q2766682):
Displaying 44 items.
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Directed NLC-width (Q906393) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Long induced paths in minor-closed graph classes and beyond (Q2684889) (← links)
- (Q4553282) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Dense Induced Subgraphs of Dense Bipartite Graphs (Q4986805) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- (Q5136270) (← links)
- (Q5878618) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- \(t\)-sails and sparse hereditary classes of unbounded tree-width (Q6612294) (← links)
- Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets (Q6635076) (← links)
