𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Section I—Triangulations

Book ID
110548641
Publisher
Springer-Verlag
Year
1951
Tongue
English
Weight
229 KB
Volume
22
Category
Article
ISSN
1432-1394

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Section I.—Triangulations
Section I.—Triangulations
✍ P. Jacquinet; A. Marussi 📂 Article 📅 1951 🏛 Springer-Verlag 🌐 English ⚖ 310 KB
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 kernels in i-triangulated graphs
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