# Some remarks about factors of graphs

@article{Correa2008SomeRA, title={Some remarks about factors of graphs}, author={J. R. Correa and M. Matamala}, journal={J. Graph Theory}, year={2008}, volume={57}, pages={265-274} }

A (g, f )-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(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) < λdegE(v) < f(v) for any λ ∈ [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. © 2008 Wiley… Expand

#### Topics from this paper

#### 4 Citations

Independence Number, Connectivity and All Fractional (a, b, k)-Critical Graphs

- Computer Science, Mathematics
- Discuss. Math. Graph Theory
- 2019

3

#### References

SHOWING 1-10 OF 22 REFERENCES

Simplified existence theorems for (g, f)-factors

- Computer Science, Mathematics
- Discret. Appl. Math.
- 1990

39

Algorithms for Degree Constrained Graph Factors of Minimum Deficiency

- Mathematics, Computer Science
- J. Algorithms
- 1993

29

An Algorithmic Proof of Tutte's f-Factor Theorem

- Mathematics, Computer Science
- J. Algorithms
- 1985

80 Highly Influential

Graph factors and factorization: 1985-2003: A survey

- Computer Science, Mathematics
- Discret. Math.
- 2007

97- PDF

An approximate König's theorem for edge-coloring weighted bipartite graphs

- Mathematics, Computer Science
- STOC '04
- 2004

6

An edge-coloration theorem for bipartite graphs with applications

- Computer Science, Mathematics
- Discret. Math.
- 1978

13- PDF