Keywords: 3r1c well-covered.svg 3-regular 1-connected well-covered graph formed by replacing each node of a six-node path by one of three different graph fragments own David Eppstein 2011-08-10 Cc-zero Graph theory Files by User David Eppstein from en wikipedia |