File:Well-covered graph.svg

Summary

Description
English: A well-covered graph, the intersection graph of the nine diagonals of a hexagon. The same graph is also one of the members of the Petersen family. One of its 14 maximal independent sets is shown as the set of red vertices; each maximal independent set has the same number of vertices, and each corresponds to one of the 14 triangulations of the hexagon.
Date
Source Own work Modified from one of the graphs in File:Petersen family.svg
Author David Eppstein

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Category:CC-Zero#Well-covered%20graph.svg
Category:Self-published work Category:Files by User:David Eppstein from en.wikipedia Category:Independent set (graph theory)
Category:CC-Zero Category:Files by User:David Eppstein from en.wikipedia Category:Independent set (graph theory) Category:Self-published work