A simple existence criterion for \((g<f)\)-factors (Q757439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:757439 |
scientific article; zbMATH DE number 4191729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple existence criterion for \((g<f)\)-factors |
scientific article; zbMATH DE number 4191729 |
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
0.8448402285575867
0 references
0.8393234610557556
0 references
0.8341752886772156
0 references
0.8145334720611572
0 references
0.8086819052696228
0 references
