Graph transformations preserving the stability number
From MaRDI portal
Recommendations
Cites work
- A class of perfectly contractile graphs
- A magnetic procedure for the stability number
- A new property of critical imperfect graphs and some consequences
- Algorithmic Aspects of Vertex Elimination on Graphs
- Coloring Artemis graphs
- Complement reducible graphs
- Dirac-type characterizations of graphs without long chordless cycles
- Even pairs
- Even pairs in Berge graphs
- Graph transformations preserving the stability number
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3904619 (Why is no real title available?)
- scientific article; zbMATH DE number 3943843 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1512194 (Why is no real title available?)
- Local transformations of graphs preserving independence number
- On rigid circuit graphs
- On the use of Boolean methods for the computation of the stability number
- Perfectly contractile graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Stability in circular arc graphs
- Struction revisited
- The ellipsoid method and its consequences in combinatorial optimization
- The strong perfect graph theorem
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
Cited in
(3)
This page was built for publication: Graph transformations preserving the stability number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5916099)