Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: factor

Sortuj według:

Ogranicz wyniki do:

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

On k-factor-critical graphs

100%

Favaron O.

Discussiones Mathematicae Graph Theory

1996

tom 16

nr 1

41-51

A graph is said to be k-factor-critical if the removal of any set of k vertices results in a graph with a perfect matching. We study some properties of k-factor-critical graphs and show that many results on q-extendable graphs can be improved using this concept.

Disjoint triangles and quadrilaterals in a graph

100%

Wang H.

Open Mathematics

2008

tom 6

nr 4

543-558

Let n, s and t be three integers with s ≥ 1, t ≥ 0 and n = 3s + 4t. Let G be a graph of order n such that the minimum degree of G is at least (n + s)/2. Then G contains a 2-factor with s + t components such that s of them are triangles and t of them are quadrilaterals.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Open Mathematics

1 Favaron O.

1 Wang H.

1 2008

1 1996

Wyniki wyszukiwania

On k-factor-critical graphs

Disjoint triangles and quadrilaterals in a graph