Clique‐width: Harnessing the power of atoms

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
Graph classes with structured neighborhoods and algorithmic applications
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Colouring of graphs with Ramsey-type forbidden subgraphs
Two complexity results for the vertex coloring problem
The behavior of clique-width under graph operations and graph transformations
On distance-3 matchings and induced matchings
Colouring vertices of triangle-free graphs without forests
The structure of bull-free graphs II and III -- a summary
On rigid circuit graphs
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Classifying the clique-width of \(H\)-free bipartite graphs
Recent developments on graphs of bounded clique-width
Decomposition by clique separators
Paw-free graphs
Generalized coloring for tree-like graphs
On easy and hard hereditary classes of graphs with respect to the independent set problem
Structure and algorithms for (cap, even hole)-free graphs
Towards an isomorphism dichotomy for hereditary graph classes
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
Edge dominating set and colorings on graphs with fixed clique-width
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
Linear time solvable optimization problems on graphs of bounded clique-width
Upper bounds to the clique width of graphs
Clique-width: harnessing the power of atoms
The intersection of two vertex coloring problems
Colouring square-free graphs without long induced paths
Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
Colouring diamond-free graphs
Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
Bounding clique-width via perfect graphs
Clique-width for 4-vertex forbidden subgraphs
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Approximating clique-width and branch-width
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
Steiner trees for hereditary graph classes: a treewidth perspective
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
Domination When the Stars Are Out
THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
Clique-Width for Graph Classes Closed under Complementation
Clique-width for hereditary graph classes
ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P₄'S
On the Relationship Between Clique-Width and Treewidth
Bounding the Clique‐Width of H‐Free Chordal Graphs
Improved Bounds for the Flat Wall Theorem
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
Hardness of computing width parameters based on branch decompositions over the vertex set
Clique-width and well-quasi-ordering of triangle-free graph classes
Bounding the clique-width of \(H\)-free split graphs
On graphs with no induced five‐vertex path or paraglider
Bounding the mim‐width of hereditary graph classes

This page was built for publication: Clique‐width: Harnessing the power of atoms