- Tytuł:
- Hajós theorem for list colorings of hypergraphs
- Autorzy:
-
Benzaken, Claude
Gravier, Sylvain
Skrekovski, Riste - Powiązania:
- https://bibliotekanauki.pl/articles/743401.pdf
- Data publikacji:
- 2003
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
list-coloring
Hajós' construction
hypergraph - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2003, 23, 2; 207-213
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł