Two-anticoloring of planar and related graphs

Daniel Berend; Ephraim Korach; Shira Zucker

doi:10.46298/dmtcs.3388

Two-anticoloring of planar and related graphs

Daniel Berend, Ephraim Korach, Shira Zucker

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2005 In-ternational Conference on Analysis of Algorithms,
Editors	Conrado Martínez
Place of Publication	Barcelona
Publisher	DMTCS
Pages	335-342
DOIs	https://doi.org/10.46298/dmtcs.3388
State	Published - Jan 2005

Keywords

Graph
algorithm
combinatorial optimization
graph anticoloring
separation

Access to Document

10.46298/dmtcs.3388

Cite this

@inproceedings{e3f7c310c00d418790ea4556611c50e9,

title = "Two-anticoloring of planar and related graphs",

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.",

keywords = "Graph, algorithm, combinatorial optimization, graph anticoloring, separation",

author = "Daniel Berend and Ephraim Korach and Shira Zucker",

year = "2005",

month = jan,

doi = "10.46298/dmtcs.3388",

language = "English",

pages = "335--342",

editor = "Conrado Mart{\'i}nez",

booktitle = "2005 In-ternational Conference on Analysis of Algorithms,",

publisher = "DMTCS",

}

TY - GEN

T1 - Two-anticoloring of planar and related graphs

AU - Berend, Daniel

AU - Korach, Ephraim

AU - Zucker, Shira

PY - 2005/1

Y1 - 2005/1

N2 - 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.

AB - 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.

KW - Graph

KW - algorithm

KW - combinatorial optimization

KW - graph anticoloring

KW - separation

U2 - 10.46298/dmtcs.3388

DO - 10.46298/dmtcs.3388

M3 - Conference contribution

SP - 335

EP - 342

BT - 2005 In-ternational Conference on Analysis of Algorithms,

A2 - Martínez, Conrado

PB - DMTCS

CY - Barcelona

ER -

Two-anticoloring of planar and related graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this