Re: maximal 3-colorable subset
- From: gwoegi@xxxxxxxxxxxxxxxxxxxxxx (GJ Woeginger)
- Date: 24 Nov 2006 10:59:19 GMT
johank <j.kwisthout@xxxxxxxxx> wrote:
# Hi all,
#
# I am looking for references on the following problem:
#
# given a graph G=(V,E), is there a subset V' of V of size k that is
# 3-colorable?
#
# That is, a optimisation variant of graph coloring that fixes the number
# of colors, and optimises the number of vertices that can be colored,
# rather than optimising the number of colors used to color everything.
#
# Although this seems a rather 'natural' problem to me I have
# difficulties finding references that address such problems. Any
# pointers would me most appreciated.
Here is a reference.
M. Yannakakis, F. Gavril
The maximum k-colorable subgraph problem for chordal graphs.
Information Processing Letters 24 (1987), 133-137.
--Gerhard
___________________________________________________________
Gerhard J. Woeginger http://www.win.tue.nl/~gwoegi/
.
- References:
- maximal 3-colorable subset
- From: johank
- maximal 3-colorable subset
- Prev by Date: maximal 3-colorable subset
- Next by Date: Re: An easy way to prove P != NP
- Previous by thread: maximal 3-colorable subset
- Index(es):
Relevant Pages
|
Loading