Anticoloring of a family of grid graphs

D. Berend; E. Korach; S. Zucker

doi:10.1016/j.disopt.2008.02.001

Anticoloring of a family of grid graphs

D. Berend, E. Korach, S. Zucker

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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, in the particular cases of graphs which are strong products of two paths or two cycles, and provide an explicit optimal solution.

Original language	English
Pages (from-to)	647-662
Number of pages	16
Journal	Discrete Optimization
Volume	5
Issue number	3
DOIs	https://doi.org/10.1016/j.disopt.2008.02.001
State	Published - 1 Aug 2008

Keywords

Algorithm
Cayley graph
Combinatorial optimization
Graph
Graph anticoloring

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/j.disopt.2008.02.001

Cite this

@article{90a74a2c6e034d9f8f17177e7101aeae,

title = "Anticoloring of a family of grid 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, in the particular cases of graphs which are strong products of two paths or two cycles, and provide an explicit optimal solution.",

keywords = "Algorithm, Cayley graph, Combinatorial optimization, Graph, Graph anticoloring",

author = "D. Berend and E. Korach and S. Zucker",

year = "2008",

month = aug,

day = "1",

doi = "10.1016/j.disopt.2008.02.001",

language = "English",

volume = "5",

pages = "647--662",

journal = "Discrete Optimization",

issn = "1572-5286",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Anticoloring of a family of grid graphs

AU - Berend, D.

AU - Korach, E.

AU - Zucker, S.

PY - 2008/8/1

Y1 - 2008/8/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, in the particular cases of graphs which are strong products of two paths or two cycles, and 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, in the particular cases of graphs which are strong products of two paths or two cycles, and provide an explicit optimal solution.

KW - Algorithm

KW - Cayley graph

KW - Combinatorial optimization

KW - Graph

KW - Graph anticoloring

UR - http://www.scopus.com/inward/record.url?scp=43849095648&partnerID=8YFLogxK

U2 - 10.1016/j.disopt.2008.02.001

DO - 10.1016/j.disopt.2008.02.001

M3 - Article

AN - SCOPUS:43849095648

VL - 5

SP - 647

EP - 662

JO - Discrete Optimization

JF - Discrete Optimization

SN - 1572-5286

IS - 3

ER -

Anticoloring of a family of grid graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this