On well-covered triangulations: Part I
- Resource Type
- Authors
- Finbow, A.; Hartnell, B.; Nowakowski, R.; Plummer, Michael D.
- Source
- Discrete Applied Mathematics. (1-3):97-108
- Subject
- Applied Mathematics
Independent set
Discrete Mathematics and Combinatorics
Computer Science::Computational Geometry
Well-covered
Triangulation
- Language
- English
- 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.