Contractions in perfect graphs
From MaRDI portal
Cites work
- $\mathcal{P}$-matchings Parameterized by Treewidth
- 3D-interval-filament graphs
- A class of perfectly contractile graphs
- A graph‐theoretic generalization of the clique concept
- A new property of critical imperfect graphs and some consequences
- About skew partitions in minimal imperfect graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Algorithms on circular-arc graphs
- Clique relaxations in social network analysis: the maximum k-plex problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Detecting an Odd Hole
- Even pairs in Berge graphs
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Finding a maximum induced matching in weakly chordal graphs
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- Induced matchings
- Induced matchings in intersection graphs.
- On Roussel-Rubio-type lemmas and their consequences
- On the complexity of testing for odd holes and induced odd paths
- Optimization problems for the maximum k-plex
- Path parity and perfection
- Perfectly contractile graphs
- The Co-2-plex Polytope and Integral Systems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The parameterized complexity of the induced matching problem
- The strong perfect graph theorem
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Trivially perfect graphs
This page was built for publication: Contractions in perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927984)
