The cost chromatic number and hypergraph parameters | Zendy

Gábor Bacsó | Zendy; Źsolt Tuza | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The cost chromatic number and hypergraph parameters

Author(s) -

Gábor Bacsó,

Źsolt Tuza

Publication year - 2006

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1329

Subject(s) - mathematics , chromatic scale , combinatorics , hypergraph , graph , edge coloring , fractional coloring , brooks' theorem , list coloring , discrete mathematics , graph power , line graph

In a graph, by deflnition, 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research