๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On well-covered triangulations: Part III

โœ Scribed by Arthur S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer

Book ID
108112836
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
807 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On well-covered triangulations: Part I
On well-covered triangulations: Part I
โœ A. Finbow; B. Hartnell; R. Nowakowski; Michael D. Plummer ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 764 KB

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.

On covering bridged plane triangulations
On covering bridged plane triangulations with balls
โœ Victor Chepoi; Yann Vaxรจs ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB

## Abstract We show that every plane graph of diameter 2__r__ in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius __r__. ยฉ 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65โ€“80, 2003

On some subclasses of well-covered graph
On some subclasses of well-covered graphs
โœ Jo Ann W. Staples ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 367 KB ๐Ÿ‘ 1 views

A set of points in a graph is independent if no two points in the set are adjacent. A graph is well covered if every maximal independent set is a maximum independent set or, equivalently, if every independent set is contained in a maximum independent set. The well-covered graphs are classified by th