Author:
Correa José R.,Matamala Martín
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference19 articles.
1. Simplified existence theorems for (g,f)-factors
2. An algorithmic proof of Tutte's f-factor theorem
3. Improved Bounds on Nonblocking 3-Stage Clos Networks
4. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC), 448–456, 1983.
5. and , Algebraic Graph Theory, Springer-Verlag, New York, 2001.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equitable factorizations of edge-connected graphs;Discrete Applied Mathematics;2022-08
2. Discussion on Fractional (a, b, k)-critical Covered Graphs;Acta Mathematicae Applicatae Sinica, English Series;2022-04
3. A degree condition for fractional (g, f, n)-critical covered graphs;AIMS Mathematics;2020
4. Toughness condition for the existence of all fractional (a,b,k)-critical graphs;Discrete Mathematics;2019-08
5. Independence number, connectivity and all fractional (a,b,k)-critical graphs;Discussiones Mathematicae Graph Theory;2019