A simple existence criterion for (g

From MaRDI portal
Publication:757439





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.




Cited in
(36)








This page was built for publication: A simple existence criterion for \((g<f)\)-factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757439)