scientific article; zbMATH DE number 7204407
From MaRDI portal
Publication:5111290
Recommendations
Cites work
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (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 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 5279372 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Approximating clique-width and branch-width
- Bounding clique-width via perfect graphs
- Bounding the clique-width of \(H\)-free chordal graphs
- Bounding the clique-width of \(H\)-free split 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 is NP-complete
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Colouring diamond-free graphs
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Colouring vertices of triangle-free graphs without forests
- Edge dominating set and colorings on graphs with fixed clique-width
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
- Improved bounds for the flat wall theorem
- Linear time solvable optimization problems on graphs of bounded clique-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- New graph classes of bounded clique-width
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the Number of Self-Complementary Graphs and Digraphs
- On the clique-width of graph with few \(P_{4}\)'s
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Recent developments on graphs of bounded clique-width
- The behavior of clique-width under graph operations and graph transformations
- The tree- and clique-width of bipartite graphs in special classes
- Upper bounds to the clique width of graphs
- Well-quasi-ordering versus clique-width: new results on bigenic classes
Cited in
(17)- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Subgraph complementation
- Clique-width of countable graphs: A compactness property.
- Inductive computations on graphs defined by clique-width expressions
- Clique‐width: Harnessing the power of atoms
- Treewidth versus clique number in graph classes with a forbidden structure
- Clique-width for hereditary graph classes
- Partial complementation of graphs
- Characterization of classical graph classes by weighted clique graphs
- Clique-width for graph classes closed under complementation
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Compact representation of graphs of small clique-width
- Clique-width and well-quasi-ordering of triangle-free graph classes
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- Computing the clique-width of cactus graphs
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Clique-width of point configurations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111290)
