Clique‐width: Harnessing the power of atoms
From MaRDI portal
Publication:6062871
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Approximating clique-width and branch-width
- Bounding clique-width via perfect graphs
- Bounding the clique-width of \(H\)-free split graphs
- Bounding the Clique‐Width of H‐Free Chordal Graphs
- Bounding the mim‐width of hereditary graph classes
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Clique-width for 4-vertex forbidden subgraphs
- Clique-width for graph classes closed under complementation
- Clique-width for hereditary graph classes
- Clique-width: harnessing the power of atoms
- Colouring diamond-free graphs
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Colouring square-free graphs without long induced paths
- Colouring vertices of triangle-free graphs without forests
- Decomposition by clique separators
- Edge dominating set and colorings on graphs with fixed clique-width
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Generalized coloring for tree-like graphs
- Graph classes with structured neighborhoods and algorithmic applications
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hardness of computing width parameters based on branch decompositions over the vertex set
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 5279372 (Why is no real title available?)
- Improved bounds for the flat wall theorem
- Linear time solvable optimization problems on graphs of bounded clique-width
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On distance-3 matchings and induced matchings
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On graphs with no induced five‐vertex path or paraglider
- On rigid circuit graphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the clique-width of graph with few \(P_{4}\)'s
- On the Relationship Between Clique-Width and Treewidth
- Paw-free graphs
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- Recent developments on graphs of bounded clique-width
- Steiner trees for hereditary graph classes: a treewidth perspective
- Structure and algorithms for (cap, even hole)-free graphs
- The behavior of clique-width under graph operations and graph transformations
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- The intersection of two vertex coloring problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The structure of bull-free graphs II and III -- a summary
- The structure of claw-free graphs
- The tree- and clique-width of bipartite graphs in special classes
- Towards an isomorphism dichotomy for hereditary graph classes
- Two complexity results for the vertex coloring problem
- Upper bounds to the clique width of graphs
This page was built for publication: Clique‐width: Harnessing the power of atoms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062871)
