The following pages link to On a conjecture of Meyniel (Q1096652):
Displaying 16 items.
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- Perfectly contractile graphs (Q803147) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- A fast algorithm for coloring Meyniel graphs (Q1111563) (← links)
- Slim graphs (Q1123217) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Path parity and perfection (Q1356748) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Perfectly contractile graphs and quadratic toric rings (Q6096783) (← links)
- Strong cliques in vertex‐transitive graphs (Q6134644) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
