Bounding clique-width via perfect graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1979486 (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?)
- Approximating clique-width and branch-width
- Approximating rank-width and clique-width quickly
- 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 edge contraction
- Clique-width for 4-vertex forbidden subgraphs
- Clique-width is NP-complete
- Clique-width of graph classes defined by two forbidden induced subgraphs
- 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
- Graph classes with and without powers of bounded clique-width
- Line graphs of bounded clique-width
- 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.
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the Relationship Between Clique-Width and Treewidth
- On the clique-width of graph with few \(P_{4}\)'s
- On the clique-width of some perfect graph classes
- On the structure of (\(P_{5}\),\,gem)-free graphs
- On variations of \(P_{4}\)-sparse graphs
- Recent developments on graphs of bounded clique-width
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- The strong perfect graph theorem
- The tree- and clique-width of bipartite graphs in special classes
Cited in
(26)- Bounding the Clique‐Width of H‐Free Chordal Graphs
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- Combinatorial problems on \(H\)-graphs
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- scientific article; zbMATH DE number 7204407 (Why is no real title available?)
- Computing the clique-width of cactus graphs
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Bounding clique-width via perfect graphs
- Bounding the clique-width of \(H\)-free split graphs
- Maximizing happiness in graphs of bounded clique-width
- On rank-width of (diamond, even-hole)-free graphs
- Clique‐width: Harnessing the power of atoms
- Graph classes with and without powers of bounded clique-width
- Clique width of partner limited graphs
- Clique-width for graph classes closed under complementation
- Bounding the clique-width of \(H\)-free split graphs
- Classifying the clique-width of \(H\)-free bipartite graphs
- Colouring diamond-free graphs
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Clique-width of graph classes defined by two forbidden induced subgraphs
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
- Query efficient implementation of graphs of bounded clique-width
- Bounding the clique-width of H-free chordal graphs
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
This page was built for publication: Bounding clique-width via perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799217)
