author: | Vladimir E. Alekseev and Alastair Farrugia and Vadim V. Lozin |
---|---|
title: | New Results on Generalized Graph Coloring |
keywords: | Generalized Graph Coloring; Polynomial algorithm; NP-completeness |
abstract: | For graph classes ℘1,...,℘k, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given
graph G can be partitioned into subsets
V1,...,Vk so that Vj induces a graph
in the class ℘j (j=1,2,...,k). If
℘1=...=℘k is the class of edgeless
graphs, then this problem coincides with
the standard vertex k-COLORABILITY,
which is known to be NP-complete for any k≥ 3.
Recently, this result has been generalized by
showing that if all ℘i's are additive
hereditary, then the generalized graph coloring
is NP-hard, with the only exception of bipartite
graphs. Clearly, a similar result follows when
all the ℘i's are co-additive.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |
reference: | Vladimir E. Alekseev and Alastair Farrugia and Vadim V. Lozin (2004), New Results on Generalized Graph Coloring, Discrete Mathematics and Theoretical Computer Science 6, pp. 215-222 |
bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
ps.gz-source: | dm060204.ps.gz (40 K) |
ps-source: | dm060204.ps (108 K) |
pdf-source: | dm060204.pdf (78 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.