On the structure of (P₅,\,gem)-free graphs
From MaRDI portal
Publication:1764802
Recommendations
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
- On algorithms for (P₅, gem)-free graphs
- On (\(P_{5}\), diamond)-free graphs
- On a Class of P 5 -Free Graphs
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- Some results on \(k\)-critical \(P_5\)-free 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 1456953 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Complement reducible 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
- Representation of a finite graph by a set of intervals on the real line
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Some classes of perfectly orderable graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- The Complexity of the Partial Order Dimension Problem
Cited in
(30)- New applications of clique separator decomposition for the maximum weight stable set problem
- Colouring of graphs with Ramsey-type forbidden subgraphs
- Towards an isomorphism dichotomy for hereditary graph classes
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Fundamentals of Computation Theory
- Algorithmic aspects of switch cographs
- Classifying the clique-width of \(H\)-free bipartite graphs
- Bounding the clique-width of \(H\)-free chordal graphs
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Bounding clique-width via perfect graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Solving some NP-complete problems using split decomposition
- On algorithms for (\(P_5\), gem)-free graphs
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- List coloring in the absence of two subgraphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- scientific article; zbMATH DE number 2227376 (Why is no real title available?)
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs
- Coloring graphs with no induced five‐vertex path or gem
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Bounding clique-width via perfect graphs
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- 2-clique-bond of stable set polyhedra
- Bounding the clique-width of \(H\)-free split graphs
This page was built for publication: On the structure of (\(P_{5}\),\,gem)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764802)
