Title
Some remarks about factors of graphs
Abstract
A (g, f)-factor of a graph is a subset F of E such that for all $v \in V$, $g(v)\le {\rm deg}_{F}(v)\le f(v)$. Lovasz gave a necessary and sufficient condition for the existence of a (g, f)-factor. We extend, to the case of edge-weighted graphs, a result of Kano and Saito who showed that if $g(v)g, f)-factor always exist. In addition, we use results of Anstee to provide new necessary and sufficient conditions for the existence of a (g, f)-factor. © 2008 Wiley Periodicals, Inc. J Graph Theory 57: 265–274, 2008
Year
DOI
Venue
2008
10.1002/jgt.v57:4
Journal of Graph Theory
Keywords
DocType
Volume
graph theory,factors
Journal
57
Issue
ISSN
Citations 
4
0364-9024
5
PageRank 
References 
Authors
0.64
12
2
Name
Order
Citations
PageRank
José R. Correa156546.87
Martín Matamala215821.63