
Let \(G\) be a graph and \(F\) a spanning subgraph of \(G\) with at least two components and with all components complete. Let \(f\) be an integer-valued function defined on \(V(G)\) with \(\sum_{x \in V(G)} f(x)\) even. If for each component \(C\) of \(F\), \(G - V(C)\) has an \(f\)-factor (that is, a spanning subgraph \(H\) in which \(\deg_H(x) = f(x)\) for all \(x \in V(G)\)), then \(G\) has an \(f\)-factor.
\(f\)-factor, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Discrete Mathematics and Combinatorics, Structural characterization of families of graphs, graph, Theoretical Computer Science
\(f\)-factor, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Discrete Mathematics and Combinatorics, Structural characterization of families of graphs, graph, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
