scientific article; zbMATH DE number 3889583
From MaRDI portal
Publication:3222886
Recommendations
Cited in
(28)- Minimal antichains in well-founded quasi-orders with an application to tournaments
- Coloring Meyniel graphs in linear time
- The anti-join composition and polyhedra
- The maximum clique problem
- Decomposition of perfect graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Recognition of quasi-Meyniel graphs
- Graphs of separability at most 2
- Coloring vertices of a graph or finding a Meyniel obstruction
- On slim graphs, even pairs, and star-cutsets
- Strong cliques in vertex‐transitive graphs
- An \(O(n^2)\) algorithm to color Meyniel graphs
- On kernels in i-triangulated graphs
- scientific article; zbMATH DE number 3878985 (Why is no real title available?)
- On a conjecture of Meyniel
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- Paw-free graphs
- Holes and dominoes in Meyniel graphs
- Polyhedral consequences of the amalgam operation
- Recognizing bull-free perfect graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Recognizing claw-free perfect graphs
- Compositions for perfect graphs
- Star-cutsets and perfect graphs
- Some properties of minimal imperfect graphs
- Erdős-Hajnal for cap-free graphs
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- Alternating orientation and alternating colouration of perfect graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222886)
