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? -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
