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

A Neighborhood Condition for Graphs to Have [a,b]-Factors II

โœ Scribed by Haruhide Matsuda

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
90 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A degree condition for a graph to have [
A degree condition for a graph to have [a,b]-factors
โœ Li, Yanjun; Mao-cheng, Cai ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 131 KB ๐Ÿ‘ 2 views

Let G be a graph of order n, and let a and b be integers such that a+b for any two nonadjacent vertices u and v in G. This result is best possible, and it is an extension of T. Iida and T. Nishimura's results (T. Iida and T. Nishimura, An Ore-type condition for the existence of k-factors in graphs,

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.