On well-covered triangulations: Part I

A graph is said to be 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 . It is the aim of this paper to prove that there are no 5-connected planar well-covered triangulations.