𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On vertex-degree restricted subgraphs in polyhedral graphs

✍ Scribed by Igor Fabrici

Book ID
108315714
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
223 KB
Volume
256
Category
Article
ISSN
0012-365X

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

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

Packing k-edge trees in graphs of restri
Packing k-edge trees in graphs of restricted vertex degrees
✍ A.K. Kelmans πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 368 KB πŸ‘ 1 views

## Abstract Let ${\cal G}^{s}\_{r}$ denote the set of graphs with each vertex of degree at least __r__ and at most __s__, __v__(__G__) the number of vertices, and Ο„~__k__~ (__G__) the maximum number of disjoint __k__‐edge trees in __G__. In this paper we show that if __G__ ∈ ${\cal G}^{s}\_{2}$ a