A <a href="https://en.wikipedia.org/wiki/Cubic_graph" class="extiw" title="en:Cubic graph">3-regular</a> <a href="https://en.wikipedia.org/wiki/k-vertex-connected_graph" class="extiw" title="en:k-vertex-connected graph">1-connected</a> <a href="https://en.wikipedia.org/wiki/Well-covered_graph" class="extiw" title="en:Well-covered graph">well-covered graph</a>, formed by replacing each node of a six-node path by one of three different graph fragments.
<a href="//commons.wikimedia.org/wiki/User:David_Eppstein" class="mw-redirect" title="User:David Eppstein">David Eppstein</a>
<span class="int-own-work" lang="en">Own work</span>