๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Spanning subgraphs with specified valencies

โœ Scribed by W.T. Tuttle

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
959 KB
Volume
9
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a Spanning Tree with Specified Leaves
On a Spanning Tree with Specified Leaves
โœ Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 88 KB
On 2-Connected Spanning Subgraphs with L
On 2-Connected Spanning Subgraphs with Low Maximum Degree
โœ Daniel P Sanders; Yue Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 408 KB

Given a graph G, let a k-trestle of G be a 2-connected spanning subgraph of G of maximum degree at most k. Also, let /(G) be the Euler characteristic of G. This paper shows that every 3-connected graph G has a (10&2/(G))-trestle. If /(G) &5, this is improved to 8&2/(G), and for /(G) &10, this is fur

Almost-Spanning Subgraphs with Bounded D
Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs
โœ Yoshiyasu Ishigami ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

We present two extensions of a theorem by Alon and Yuster (1992, Graphs Comb., 8, 95-102) that give degree conditions guaranteeing an almost-spanning subgraph isomorphic to a given graph. The first extension gives a sharp degree condition when the desired subgraph consists of small connected compone