Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: edge-connectivity

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

More on even [a,b]-factors in graphs

100%

Khodkar A., Xu R.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 1

193-204

In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction on the order of graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Khodkar A.

1 Xu R.

1 2007

Wyniki wyszukiwania

More on even [a,b]-factors in graphs