✦ LIBER ✦

On well-covered triangulations: Part I

✍ Scribed by A. Finbow; B. Hartnell; R. Nowakowski; Michael D. Plummer

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 764 KB
Volume: 132
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00393-7

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

On 4-connected claw-free well-covered gr

On 4-connected claw-free well-covered graphs

✍ Bert Hartnell; Michael D. Plummer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 556 KB

On kernels in i-triangulated graphs

✍ F Maffray 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 319 KB

A directed graph is said to be kernel-perfect if every induced subgraph possesses a kernel (independent, absorbing subset). A necessary condition for a graph to be kernel-perfect is that every complete subgraph C has an absorbing vertex (i.e., a successor of all vertices of C). In this work, we show

Superconvergence results on mildly struc

Superconvergence results on mildly structured triangulations

✍ A.M Lakhany; I Marek; J.R Whiteman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 912 KB

Bunker-stored silage covered with biodeg

Bunker-stored silage covered with biodegradable coating. Part I. Laboratory assay

✍ Patrick Denoncourt; Stéphane Caillet; Monique Lacroix 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract The effect of a hydrophobic biodegradable coating on the conservation of silage was evaluated in comparison with unsealed silage and silage covered with a polyethylene (plastic). Silage samples were subjected to biochemical analysis (pH, dry matter, water‐soluble sugars, ammoniacal nitr