A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
[chapter]
2004
Lecture Notes in Computer Science
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they are trianglefree and their maximum degree is bounded above by 4. Then, we prove that min weighted node coloring is NP-complete in P8-free bipartite graphs, but polynomial for P5-free bipartite graphs. We next focus ourselves on approximability in general bipartite graphs and improve earlier approximation results by
doi:10.1007/978-3-540-30551-4_76
fatcat:w6k2px5efvfa3ebz52to4xs2zu