A Hajós-like theorem for weighted coloring - Archive ouverte HAL Access content directly
Journal Articles Journal of the Brazilian Computer Society Year : 2013

A Hajós-like theorem for weighted coloring

(1, 2) , (1)
1
2

Abstract

The Hajós' Theorem (Wiss Z Martin Luther Univ Math-Natur Reihe, 10, pp 116-117, 1961) shows a necessary and sufficient condition for the chromatic number of a given graph $G$ to be at least $k$ : $G$ must contain a $k$ -constructible subgraph. A graph is $k$ -constructible if it can be obtained from a complete graph of order $k$ by successively applying a set of well-defined operations. Given a vertex-weighted graph $G$ and a (proper) $r$ -coloring $c=\{C_1, \ldots , C_r\}$ of $G$ , the weight of a color class $C_i$ is the maximum weight of a vertex colored $i$ and the weight of $c$ is the sum of the weights of its color classes. The objective of the Weighted Coloring Problem [7] is, given a vertex-weighted graph $G$ , to determine the minimum weight of a proper coloring of $G$ , that is, its weighted chromatic number. In this article, we prove that the Weighted Coloring Problem admits a version of the Hajós' Theorem and so we show a necessary and sufficient condition for the weighted chromatic number of a vertex-weighted graph $G$ to be at least $k$ , for any positive real $k$.
Fichier principal
Vignette du fichier
hajos_journalSBC.pdf (115.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00773410 , version 1 (14-01-2013)

Identifiers

Cite

Julio Araujo, Claudia Linhares Sales. A Hajós-like theorem for weighted coloring. Journal of the Brazilian Computer Society, 2013, 19 (3), pp.275-278. ⟨10.1007/s13173-012-0098-y⟩. ⟨hal-00773410⟩
346 View
359 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More