𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Paths with restricted degrees of their vertices in planar graphs

✍ Scribed by Stanislav Jendroľ

Book ID
110419607
Publisher
Springer
Year
1999
Tongue
English
Weight
435 KB
Volume
49
Category
Article
ISSN
0011-4642

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 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. (~

Triangles with restricted degree sum of
Triangles with restricted degree sum of their boundary vertices in plane graphs
✍ Oleg V. Borodin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 373 KB

It is known that under appropriate assumptions, each plane graph contains a vertex of degree at most 5 and a pair of adjacent vertices with degree sum at most 13. Two structural assumptions are established for a plane graph which together guarantee the existence of a triple of pairwise adjacent vert

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