On well-covered triangulations: Part I

https://doi.org/10.1016/S0166-218X(03)00393-7Get rights and content
Under an Elsevier user license
open archive

Abstract

A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It is the aim of this paper to prove that there are no 5-connected planar well-covered triangulations.

Keywords

Independent set
Well-covered
Triangulation

Cited by (0)