author: | Daniel Berend, Ephraim Korach and Shira Zucker |
---|---|
title: | Two-anticoloring of planar and related graphs |
keywords: | Graph, algorithm, combinatorial optimization, graph anticoloring, separation |
abstract: | An anticoloring of a graph is a coloring of some of the vertices, such that no two adjacent vertices are colored in distinct colors. We deal with the anticoloring problem with two colors for planar graphs, and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. In the particular cases of graphs which are strong products of two paths or two cycles, we provide an explicit optimal solution. |
If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
reference: | Daniel Berend and Ephraim Korach and Shira Zucker (2005), Two-anticoloring of planar and related graphs, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 335-342 |
bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
ps.gz-source: | dmAD0130.ps.gz (89 K) |
ps-source: | dmAD0130.ps (263 K) |
pdf-source: | dmAD0130.pdf (197 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.