Some remarks about factors of graphs |
| |
| Authors: | José R. Correa Martín Matamala |
| |
| Affiliation: | 1. School of Business, Universidad Adolfo Ibá?ez, Santiago, Chile;2. Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático, UMR 2071‐CNRS, Universidad de Chile, Santiago, Chile |
| |
| Abstract: | A (g, f)‐factor of a graph is a subset F of E such that for all  ,  . 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  for any  , 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. © 2008 Wiley Periodicals, Inc. J Graph Theory 57: 265–274, 2008 |
| |
| Keywords: | graph theory factors |
|
|
