Pages that link to "Item:Q1975365"
From MaRDI portal
The following pages link to Upper bounds to the clique width of graphs (Q1975365):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Tree-depth and vertex-minors (Q281932) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← 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)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Block-graph width (Q534563) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- On prime inductive classes of graphs (Q648987) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- On structural parameterizations of load coloring (Q831701) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
