Paper Info
Title
A Characterization of Graphs Having All (g, f)-Factors
Abstract
Let G be a graph with vertex set V and let g ,  f : V → Z + . We say that G has all ( g ,  f )-factors if G has an h -factor for every h : V → Z + such that g ( v )⩽ h ( v )⩽ f ( v ) for every v ∈ V and at least one such h exists. In this note, we derive from Tutte's f -factor theorem a similar characterization for the property of having all ( g ,  f )-factors. An analogous result for parity-factors is presented also.
Year
DOI
Venue
1998
10.1006/jctb.1997.1797
Journal of Combinatorial Theory, Series B
Field
DocType
Volume
Graph,Combinatorics,Vertex (geometry),Arithmetic,Physics
Journal
72
Issue
ISSN
Citations 
1
Journal of Combinatorial Theory, Series B
4
PageRank 
References 
Authors
0.63
4
1
Name
Order
Citations
PageRank
Thomas Niessen116418.28