✦ LIBER ✦

Interpolation theorems for a family of spanning subgraphs

✍ Scribed by Sanming Zhou

Book ID: 110419615
Publisher: Springer
Year: 1998
Tongue: English
Weight: 403 KB
Volume: 48
Category: Article
ISSN: 0011-4642
DOI: 10.1023/a:1022411426718

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classification of interpolation theorems

Classification of interpolation theorems for spanning trees and other families of spanning subgraphs

✍ Frank Harary; Michael J. Plantholt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

We say that a graphical invariant i of a graph interpolates over a family 8 of graphs if i satisfies the following property: If rn and M are the minimum and maximum values (respectively) of i over all graphs in 8 then for each k , rn 4 k I M , there is a graph H in 8 for which i ( H ) = k . In previ

Interpolation theorem for the number of

Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size

✍ C.A. Barefoot 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 162 KB

At the 4th International Graph Theory Conference (1980), G. Chartrand posed the following problem: If a (connected) graph G contains spanning trees with m and n pendant vertices, respectively, with m < n, does G contain a spanning tree with k pendant vertices for every integer k, where m<k<n? Recent

Interpolation theorem for diameters of s

Interpolation theorem for diameters of spanning trees

✍ Harary, F.; Mokken, R.; Plantholt, M. 📂 Article 📅 1983 🏛 IEEE ⚖ 472 KB

A degree condition for spanning eulerian

A degree condition for spanning eulerian subgraphs

✍ Zhi-Hong Chen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 571 KB

## Abstract Let __p__ ≥ __2__ be a fixed integer. Let __G__ be a simple and 2‐edge‐connected graph on __n__ vertices, and let __g__ be the girth of __G.__ If __d__(__u__) + __d__(__v__) ≥ (__2__/(__g − 2__))((__n/p__) − 4 + __g__) holds whenever __uv__ ∉ __E__(__G__), and if __n__ is sufficiently l

Spanning Subgraphs of a Hypercube V: Spa

Spanning Subgraphs of a Hypercube V: Spanned Subcubes

✍ FRANK HARARV; MARTIN LEWINTER 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Interpolation theorem for the number of

Interpolation theorem for the number of end-vertices of spanning trees

✍ Seymour Schuster 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The following interpolation theorem is proved: If a graph __G__ contains spanning trees having exactly __m__ and __n__ end‐vertices, with __m__ < __n__, then for every integer __k, m < k < n, G__ contains a spanning tree having exactly __k__ end‐vertices. This settles a problem posed by