book part or chapter
Complexity and Approximation Results for the Min Weighted Node Coloring Problem
February 3, 2010
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE
This chapter contains sections titled: Introduction General results Weighted node coloring in triangle-free planar graphs Weighted node coloring in bipartite graphs Split graphs Cographs Interval graphs Bibliography