Well covered graph

[Selvaraja S]

Definition:
A graph $G$ is called well-covered if all minimal vertex covers of $G$ have the same
number of elements.

What is the coding to check well-covered graph?

[Jori Mäntysalo]

Maybe you can reformulate the question using independent sets and use
PairwiseCompatibleSubsets, see the last example in page
http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/subsets_hereditary.html

--
Jori Mäntysalo