Transformations which Preserve Perfectness and H-Perfectness of Graphs
From MaRDI portal
Publication:3967551
Cited in
(40)- A transformation which preserves the clique number
- On planar perfectly contractile graphs
- No odd pairs in minimal imperfect NP\({}_{5}\) graphs.
- A class of perfectly contractile graphs
- Coloring Meyniel graphs in linear time
- Counterexamples to three conjectures concerning perfect graphs
- Even pairs in claw-free perfect graphs
- Graph transformations preserving the stability number
- On claw-free t-perfect graphs
- A magnetic procedure for the stability number
- On dart-free perfectly contractile graphs
- Path parity and perfection
- Quasi-parity and perfect graphs
- Even pairs in Berge graphs with no balanced skew-partitions
- Locally perfect graphs
- Decomposition of perfect graphs
- A new property of critical imperfect graphs and some consequences
- On cutting-plane proofs in combinatorial optimization
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- A class of h-perfect graphs
- On minimal imperfect graphs without induced P₅
- \(K_{4}\)-free graphs with no odd hole: even pairs and the circular chromatic number
- Relaxations of vertex packing
- Stability preserving transformations of graphs
- \(t\)-perfection in \(P_5\)-free graphs
- Coloring Artemis graphs
- Finding an induced path of given parity in planar graphs in polynomial time
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- Graph transformations preserving the stability number
- Short-chorded and perfect graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Complementation in T-perfect graphs
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- On the structure of bull-free perfect graphs
- Claw-free t-perfect graphs can be recognized in polynomial time
- Characterising claw-free t-perfect graphs
- Matrices with the Edmonds-Johnson property
- Contractions in perfect graphs
- About skew partitions in minimal imperfect graphs
- Finding induced paths of given parity in claw-free graphs
This page was built for publication: Transformations which Preserve Perfectness and H-Perfectness of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967551)