New lower bounds on the weighted chromatic number of a graph

DOI10.7151/DMGT.1224zbMath1063.05042OpenAlexW2038222375MaRDI QIDQ4669427

Jiří Fiala, Massimiliano Caramia

Publication date: 15 April 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0f69247ccd0fe53ea4af074012fcd96e9b7cad20

zbMATH Keywords

algorithmsNP-completenesscombinatorial analysiscoloringweighted clique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: New lower bounds on the weighted chromatic number of a graph