Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Opuscula Mathematica

1 2017

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: [1, k]-factor.

Sortuj według:

Ogranicz wyniki do:

On strongly spanning k-edge-colorable subgraphs

Mkrtchyan V. V., Vardanyan G. N.

Opuscula Mathematica

2017

Vol. 37, no. 3

447--456

A subgraph H of a multigraph G is called strongly spanning, if any vertex of G is not isolated in H. H is called maximum k-edge-colorable, if H is proper k-edge-colorable and has the largest size. We introduce a graph-parameter sp(G), that coincides with the smallest k for which a multigraph G has a maximum k-edge-colorable subgraph that is strongly spanning. Our first result offers some alternative definitions of sp(G). Next, we show that Δ (G) is an upper bound for sp(G), and then we characterize the class of multigraphs G that satisfy sp(G) = Δ (G). Finally, we prove some bounds for sp(G) that involve well-known graph-theoretic parameters.