Results 251 to 260 of about 115,711 (260)
Some of the next articles are maybe not open access.
Acta Mathematica Scientia, 1989
Summary: A graph G is k-covered if each edge of G belongs to a k-factor of G. We determine some values of k for which every regular graph with edge- connectivity \(\lambda\) is k-covered.
openaire +2 more sources
Summary: A graph G is k-covered if each edge of G belongs to a k-factor of G. We determine some values of k for which every regular graph with edge- connectivity \(\lambda\) is k-covered.
openaire +2 more sources