Cites work
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- An algebraic theory of graph reduction
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Easy problems for tree-decomposable graphs
- Graph minors. V. Excluding a planar graph
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handle-rewriting hypergraph grammars
- Incremental modular decomposition
- Monadic second-order evaluations on tree-decomposable graphs
- Structural properties of context-free sets of graphs generated by vertex replacement
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- The monadic second-order logic of graphs. VIII: Orientations
- The monadic second-order logic of graphs. X: Linear orderings
- The structure of the models of decidable monadic theories of graphs
- Upper bounds to the clique width of graphs
- \(k\)-NLC graphs and polynomial algorithms
Cited in
(only showing first 100 items - show all)- Parameterized model checking of rendezvous systems
- On strict (outer-)confluent graphs
- Mock threshold graphs
- On strict (outer-)confluent graphs
- Rank-width: algorithmic and structural results
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Bounding the clique-width of \(H\)-free split graphs
- scientific article; zbMATH DE number 7559449 (Why is no real title available?)
- scientific article; zbMATH DE number 1439435 (Why is no real title available?)
- Acyclic coloring parameterized by directed clique-width
- On structural parameterizations of load coloring
- Rainbow independent sets on dense graph classes
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
- Solving problems on generalized convex graphs via mim-width
- Eigenvalue location in graphs of small clique-width
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- Compact and localized distributed data structures
- Alliances in graphs of bounded clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Parameterized algorithms for the happy set problem
- Reasoning about integrity constraints for tree-structured data
- Bounding the clique-width of \(H\)-free chordal graphs
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- Boundary classes for graph problems involving non-local properties
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- A local characterization of bounded clique-width for line graphs
- More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints
- On the thinness and proper thinness of a graph
- Graph classes with and without powers of bounded clique-width
- A monadic second-order definition of the structure of convex hypergraphs.
- Fast exact algorithms for some connectivity problems parameterized by clique-width
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Colouring square-free graphs without long induced paths
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- Are there any good digraph width measures?
- Vertex-minor reductions can simulate edge contractions
- Latency-bounded target set selection in social networks
- The evaluation of first-order substitution is monadic second-order compatible
- Collective tree spanners in graphs with bounded parameters
- Computing the largest bond and the maximum connected cut of a graph
- Bounding the Mim-Width of Hereditary Graph Classes.
- Tree pivot-minors and linear rank-width
- On the structure of (pan, even hole)-free graphs
- The recognizability of sets of graphs is a robust property
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- Containment of monadic Datalog programs via bounded clique-width
- Low-congestion shortcut and graph parameters
- Solutions for subset sum problems with special digraph constraints
- Independent set reconfiguration in cographs and their generalizations
- Bounding the clique-width of \(H\)-free split graphs
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Recent developments on graphs of bounded clique-width
- Boundary Classes of Planar Graphs
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- The enumeration of vertex induced subgraphs with respect to the number of components
- Clique-width of countable graphs: A compactness property.
- An extension of the bivariate chromatic polynomial
- On structural parameterizations of star coloring
- Efficient algorithms for Roman domination on some classes of graphs
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Fifty years of the spectrum problem: survey and new results
- Colouring vertices of triangle-free graphs
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Automata for the verification of monadic second-order graph properties
- A model-theoretic characterisation of clique width
- Circle graphs and monadic second-order logic
- Tree-depth and vertex-minors
- Graphs of linear clique-width at most 3
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Are there any good digraph width measures?
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Upper bounds to the clique width of graphs
- On switching classes, NLC-width, cliquewidth and treewidth
- Digraph width measures in parameterized algorithmics
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Stability number of bull- and chair-free graphs revisited
- Enumeration of minimal dominating sets and variants
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Solving \#SAT using vertex covers
- On the OBDD size for graphs of bounded tree- and clique-width
- The most vital nodes with respect to independent set and vertex cover
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- On the model-checking of monadic second-order formulas with edge set quantifications
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Rank-width and vertex-minors
- On variations of \(P_{4}\)-sparse graphs
- Rank-width and tree-width of \(H\)-minor-free graphs
- A characterisation of clique-width through nested partitions
- The coloring problem for classes with two small obstructions
This page was built for publication: Upper bounds to the clique width of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975365)
