Planar Regular One-Well-Covered Graphs

摘要

An independent set in a graph is a subset of vertices with the property that notwo of the vertices are joined by an edge, and a maximum independent set in a graph is an independent set of the largest possible size. A graph is called well-covered if every independent set that is maximal with respect to set inclusion is