A simple existence criterion for \((g<f)\)-factors (Q757439): Difference between revisions
From MaRDI portal
Revision as of 14:12, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple existence criterion for \((g<f)\)-factors |
scientific article |
Statements
A simple existence criterion for \((g<f)\)-factors (English)
0 references
1990
0 references
The criterion of Lovász for the existence of a (g,f)-factor when \(g<f\), or when the graph is bipartite is simplified and a simple direct proof, implying an O(\(\sqrt{(g(V))}\cdot | E|)\) algorithm, for these cases is given.
0 references
criterion of Lovász
0 references
(g,f)-factor
0 references
algorithm
0 references
