- Tytuł:
- The cost chromatic number and hypergraph parameters
- Autorzy:
-
Bacsó, Gábor
Tuza, Zsolt - Powiązania:
- https://bibliotekanauki.pl/articles/743998.pdf
- Data publikacji:
- 2006
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph coloring
cost chromatic number
intersection number of a hypergraph - Opis:
- In a graph, by definition, the weight of a (proper) coloring with positive integers is the sum of the colors. The chromatic sum is the minimum weight, taken over all the proper colorings. The minimum number of colors in a coloring of minimum weight is the cost chromatic number or strength of the graph. We derive general upper bounds for the strength, in terms of a new parameter of representations by edge intersections of hypergraphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2006, 26, 3; 369-376
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł