A simple existence criterion for (g)-factors
Discrete Mathematics
Algorithms for degree constrained graph factors of minimum deficiency
Journal of Algorithms
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.00 |
We establish two results for (g, f)-factorizations: 1. every (mg + m - 1, mf - m + 1 )-graph with 9k/4 驴 g 驴 f has a (g, f)-factorization orthogonal to any set of k given edge disjoint m-subgraphs of G; 2. every (0, mf - m+1)-graph G with f 驴 k+2 has a (0, f)-factorization orthogonal to any set of k given vertex disjoint m-subgraphs of G. Polynomial-time algorithms to find the claimed orthogonal factorizations under the above conditions are presented.