Maximizing the number of unused colors in the vertex coloring problem

Refael Hassin; Shlomo Lahav (Haddad)

doi:10.1016/0020-0190(94)00113-8

Maximizing the number of unused colors in the vertex coloring problem

Refael Hassin^*
, Shlomo Lahav (Haddad)

^*Corresponding author for this work

School of Mathematical Sciences

Tel Aviv University

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

24 Scopus citations

Original language	English
Pages (from-to)	87-90
Number of pages	4
Journal	Information Processing Letters
Volume	52
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(94)00113-8
State	Published - 28 Oct 1994

Keywords

Analysis of algorithms
Combinatorial problems
Computational complexity

Access to Document

10.1016/0020-0190(94)00113-8

Cite this

@article{9472caed03ac44dc954cdb22018001ce,

title = "Maximizing the number of unused colors in the vertex coloring problem",

keywords = "Analysis of algorithms, Combinatorial problems, Computational complexity",

author = "Refael Hassin and \{Lahav (Haddad)\}, Shlomo",

year = "1994",

month = oct,

day = "28",

doi = "10.1016/0020-0190(94)00113-8",

language = "אנגלית",

volume = "52",

pages = "87--90",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Maximizing the number of unused colors in the vertex coloring problem

AU - Hassin, Refael

AU - Lahav (Haddad), Shlomo

PY - 1994/10/28

Y1 - 1994/10/28

KW - Analysis of algorithms

KW - Combinatorial problems

KW - Computational complexity

UR - https://www.scopus.com/pages/publications/0028525875

U2 - 10.1016/0020-0190(94)00113-8

DO - 10.1016/0020-0190(94)00113-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0028525875

SN - 0020-0190

VL - 52

SP - 87

EP - 90

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Maximizing the number of unused colors in the vertex coloring problem

Keywords

Access to Document

Other files and links

Cite this