On well-covered triangulations: Part I
- Resource Type
- Article
- Authors
- Finbow, A.; Hartnell, B.; Nowakowski, R.; Plummer, Michael D.
- Source
- Discrete Applied Mathematics. Oct2003, Vol. 132 Issue 1-3, p97. 12p.
- Subject
- *TRIANGULATION
*GRAPHIC methods
*GRAPH theory
*TOPOLOGY
- Language
- ISSN
- 0166-218X
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. [Copyright &y& Elsevier]