Some remarks about factors of graphs

Author	dc.contributor.author	Correa, José R.
Author	dc.contributor.author	Matamala Vásquez, Martín	es_CL
Admission date	dc.date.accessioned	2010-01-14T15:25:29Z
Available date	dc.date.available	2010-01-14T15:25:29Z
Publication date	dc.date.issued	2008-04
Cita de ítem	dc.identifier.citation	JOURNAL OF GRAPH THEORY Volume: 57 Issue: 4 Pages: 265-274 Published: APR 2008	en_US
Identifier	dc.identifier.issn	0364-9024
Identifier	dc.identifier.other	10.1002/jgt.20284
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/125123
Abstract	dc.description.abstract	A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)(V) <= 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) < lambda deg(E)(V) < f(v) for any lambda is an element of [0, 1], then a (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.	en_US
Lenguage	dc.language.iso	en	en_US
Publisher	dc.publisher	JOHN WILEY	en_US
Keywords	dc.subject	THEOREM	en_US
Título	dc.title	Some remarks about factors of graphs	en_US
Document type	dc.type	Artículo de revista