✦ LIBER ✦

Section I.—Triangulations

✍ Scribed by P. Jacquinet; A. Marussi

Book ID: 110548636
Publisher: Springer-Verlag
Year: 1951
Tongue: English
Weight: 310 KB
Volume: 22
Category: Article
ISSN: 1432-1394
DOI: 10.1007/bf02526238

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Section I—Triangulations

📂 Article 📅 1951 🏛 Springer-Verlag 🌐 English ⚖ 229 KB

Proceedings of the Meetings of Section I

Proceedings of the Meetings of Section I (Triangulation)

✍ L. Asplund 📂 Article 📅 1962 🏛 Springer-Verlag 🌐 English ⚖ 685 KB

Liste des communications présentées a l’

Liste des communications présentées a l’Assemblée Générale de Bruxelles a la Section I.—Triangulations

✍ A. Marussi 📂 Article 📅 1952 🏛 Springer-Verlag 🌐 English ⚖ 203 KB

When I say … triangulation

✍ Walsh, Kieran 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 32 KB

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

✍ 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