✦ LIBER ✦

Subgraphs with Restricted Degrees of Their Vertices in Polyhedral Maps on Compact 2-Manifolds

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

Publisher: Springer
Year: 2001
Tongue: English
Weight: 155 KB
Volume: 5
Category: Article
ISSN: 0218-0006
DOI: 10.1007/pl00001301

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Subgraphs with restricted degrees of the

Subgraphs with restricted degrees of their vertices in planar graphs

✍ Igor Fabrici; Stanislav Jendrol' 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 335 KB

We prove that every 3-connected planar graph G of order at least k contains a connected subgraph H on k vertices each of which has degree (in G) at most 4k + 3, the bound 4k + 3 being best possible. (~