Chordal co-gem-free and (P₅,\,gem)-free graphs have bounded clique-width
From MaRDI portal
Publication:1764808
Recommendations
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- Bounding the clique-width of \(H\)-free chordal graphs
- Bounding the Clique‐Width of H‐Free Chordal Graphs
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- On algorithms for (P₅, gem)-free graphs
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
- Clique polynomials of \(2\)-connected \(K_5\)-free chordal graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 2044924 (Why is no real title available?)
- scientific article; zbMATH DE number 1512682 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A characterization of ptolemaic graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Complement reducible graphs
- Completely separable graphs
- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
- Distance-hereditary graphs
- Efficient and practical algorithms for sequential modular decomposition
- Graph Classes: A Survey
- Handle-rewriting hypergraph grammars
- Linear time solvable optimization problems on graphs of bounded clique-width
- Modular decomposition and transitive orientation
- On the clique-width of graph with few \(P_{4}\)'s
- On the clique-width of some perfect graph classes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The Complexity of the Partial Order Dimension Problem
- The Pathwidth and Treewidth of Cographs
- Upper bounds to the clique width of graphs
Cited in
(26)- New applications of clique separator decomposition for the maximum weight stable set problem
- Optimal centrality computations within bounded clique-width graphs
- Recent developments on graphs of bounded clique-width
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
- Clique‐width: Harnessing the power of atoms
- On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs
- Classifying the clique-width of \(H\)-free bipartite graphs
- Bounding the clique-width of \(H\)-free chordal graphs
- Colouring diamond-free graphs
- Bounding clique-width via perfect graphs
- Bounding the mim‐width of hereditary graph classes
- A local characterization of bounded clique-width for line graphs
- On algorithms for (\(P_5\), gem)-free graphs
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Clique-width for graph classes closed under complementation
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- On distance-3 matchings and induced matchings
- Bounding the Mim-Width of Hereditary Graph Classes.
- Bounding clique-width via perfect graphs
- scientific article; zbMATH DE number 7204407 (Why is no real title available?)
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Bounding the clique-width of \(H\)-free split graphs
This page was built for publication: Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764808)
