Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Hajós' construction

Sortuj według:

Ogranicz wyniki do:

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

Hajós' theorem for list colorings of hypergraphs

100%

Benzaken C., Gravier S., Skrekovski R.

Discussiones Mathematicae Graph Theory

2003

tom 23

nr 2

207-213

A well-known theorem of Hajós claims that every graph with chromathic number greater than k can be constructed from disjoint copies of the complete graph $K_{k+1}$ by repeated application of three simple operations. This classical result has been extended in 1978 to colorings of hypergraphs by C. Benzaken and in 1996 to list-colorings of graphs by S. Gravier. In this note, we capture both variations to extend Hajós' theorem to list-colorings of hypergraphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Benzaken C.

1 Gravier S.

1 Skrekovski R.

1 2003

Wyniki wyszukiwania

Hajós' theorem for list colorings of hypergraphs