Anticoloring and separation of graphs

D. Berend; E. Korach; S. Zucker

doi:10.1016/j.disc.2009.03.027

Anticoloring and separation of graphs

D. Berend, E. Korach, S. Zucker

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

2 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. The anticoloring problem seeks, roughly speaking, such colorings with many vertices colored in each color. We deal with the anticoloring problem for planar graphs and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. We also show that, to solve the anticoloring problem for general graphs, it suffices to solve it for connected graphs.

Original language	English
Pages (from-to)	390-399
Number of pages	10
Journal	Discrete Mathematics
Volume	310
Issue number	3
DOIs	https://doi.org/10.1016/j.disc.2009.03.027
State	Published - 6 Feb 2010

Keywords

Algorithm
Combinatorial optimization
Disconnected graph
Graph anticoloring
Planar graph
Separation

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2009.03.027

Cite this

@article{020e8b3a894f4ed48be7477e41a74e6f,

title = "Anticoloring and separation of 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. The anticoloring problem seeks, roughly speaking, such colorings with many vertices colored in each color. We deal with the anticoloring problem for planar graphs and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. We also show that, to solve the anticoloring problem for general graphs, it suffices to solve it for connected graphs.",

keywords = "Algorithm, Combinatorial optimization, Disconnected graph, Graph anticoloring, Planar graph, Separation",

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

year = "2010",

month = feb,

day = "6",

doi = "10.1016/j.disc.2009.03.027",

language = "English",

volume = "310",

pages = "390--399",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Anticoloring and separation of graphs

AU - Berend, D.

AU - Korach, E.

AU - Zucker, S.

PY - 2010/2/6

Y1 - 2010/2/6

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. The anticoloring problem seeks, roughly speaking, such colorings with many vertices colored in each color. We deal with the anticoloring problem for planar graphs and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. We also show that, to solve the anticoloring problem for general graphs, it suffices to solve it for connected graphs.

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. The anticoloring problem seeks, roughly speaking, such colorings with many vertices colored in each color. We deal with the anticoloring problem for planar graphs and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. We also show that, to solve the anticoloring problem for general graphs, it suffices to solve it for connected graphs.

KW - Algorithm

KW - Combinatorial optimization

KW - Disconnected graph

KW - Graph anticoloring

KW - Planar graph

KW - Separation

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

U2 - 10.1016/j.disc.2009.03.027

DO - 10.1016/j.disc.2009.03.027

M3 - Article

AN - SCOPUS:70449704965

VL - 310

SP - 390

EP - 399

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 3

ER -

Anticoloring and separation of graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this