On a conjecture of Meyniel
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- A new property of critical imperfect graphs and some consequences
- Meyniel graphs are strongly perfect
- Normal hypergraphs and the perfect graph conjecture
- On the perfect graph conjecture
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(23)- Coloring Meyniel graphs in linear time
- Murky graphs
- Colouring Some Classes of Perfect Graphs Robustly
- Path parity and perfection
- scientific article; zbMATH DE number 3884201 (Why is no real title available?)
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- Coloring vertices of a graph or finding a Meyniel obstruction
- Detecting strong cliques
- Strong cliques in diamond-free graphs
- Structure and algorithms for (cap, even hole)-free graphs
- Strong cliques in vertex‐transitive graphs
- scientific article; zbMATH DE number 3878985 (Why is no real title available?)
- A fast algorithm for coloring Meyniel graphs
- Finding a strong stable set or a Meyniel obstruction in any graph
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Perfectly contractile graphs
- On the Breuil-Mézard conjecture
- On Meyniel's conjecture of the cop number
- Graphs vertex-partitionable into strong cliques
- Perfectly contractile graphs and quadratic toric rings
- Slim graphs
- Some properties of minimal imperfect graphs
- Alternating orientation and alternating colouration of perfect graphs
This page was built for publication: On a conjecture of Meyniel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096652)
