- Tytuł:
- A note on a list colouring of hypergraphs
- Autorzy:
- Drgas-Burchardt, E.
- Powiązania:
- https://bibliotekanauki.pl/articles/2050379.pdf
- Data publikacji:
- 2004
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
hypergraph
list colouring - Opis:
- In the note we present two results. The first of them gives a sufficient condition for a colouring of a hypergraph from an assigned list. It generalises the analogous fact for graphs. The second result states that for every $k \geq 3$ and every $l \geq 2$, a distance between the list chromatic number and the chromatic number can be arbitrarily large in the class of k-uniform hypergraphs with the chromatic number bounded below by l. A similar result for k-uniform, 2-colorable hypergraphs is known but the proof techniques are different.
- Źródło:
-
Opuscula Mathematica; 2004, 24, 2; 171-175
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł