✦ LIBER ✦

Light paths with an odd number of vertices in large polyhedral maps

✍ Scribed by S. Jendrol'; H. -J. Voss

Publisher: Springer
Year: 1998
Tongue: English
Weight: 704 KB
Volume: 2
Category: Article
ISSN: 0218-0006
DOI: 10.1007/bf01608528

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Light Paths in Large Polyhedral Maps wit

Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree

✍ S. Jendrol; H.-J. Voss 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 961 KB

Polyhedral Structures with an Odd Number

Polyhedral Structures with an Odd Number of Vertices: Nine-Coordinate Metal Compounds

✍ Antonio Ruiz-Martínez; David Casanova; Santiago Alvarez 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 798 KB

ChemInform Abstract: Polyhedral Structur

ChemInform Abstract: Polyhedral Structures with an Odd Number of Vertices: Nine-atom Clusters and Supramolecular Architectures

✍ Antonio Ruiz-Martinez; David Casanova; Santiago Alvarez 📂 Article 📅 2008 🏛 John Wiley and Sons ⚖ 15 KB 👁 1 views

Subgraphs with Restricted Degrees of the

Subgraphs with Restricted Degrees of their Vertices in Large Polyhedral Maps on Compact Two-manifolds

✍ S. Jendrol’; H.-J. Voss 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Let k ≥ 2, be an integer and M be a closed two-manifold with Euler characteristic χ(M) ≤ 0. We prove that each polyhedral map G on M, which has at least (8k 2 + 6k -6)|χ (M)| vertices, contains a connected subgraph H of order k such that every vertex of this subgraph has, in G, the degree at most 4k