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

Some Sufficient Conditions for Groups to Have One End

โœ Scribed by Houghton, C. H.; Segal, D.

Book ID
120095997
Publisher
Oxford University Press
Year
1975
Tongue
English
Weight
202 KB
Volume
s2-10
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

More sufficient conditions for a graph t
More sufficient conditions for a graph to have factors
โœ R.P. Anstee; Yunsun Nam ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 459 KB

This paper explores the problem of finding degree constrained subgraphs (i.e. (g, f)-factors) of a given graph using fractional subgraphs as a basis. These fractional subgraphs are often easy to obtain by heuristics. We apply our results to generalize results of Kano, Bermond and Las Vergnas among o

Sufficient conditions for graphs to have
Sufficient conditions for graphs to have (g, f)-factors
โœ Yoshimi Egawa; Mikio Kano ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 170 KB

We give sufficient conditions for a graph to have a (g,f)-factor. For example, we prove that a graph G has a (g,f)-factor if g(v) < f(v) for all vertices v of G and g(x)/deg~(x) <~ f(y)/deg~(y) for all adjacent vertices x and y of G.