TY - JOUR

T1 - The strong chromatic number of a graph

AU - Alon, Noga

PY - 1992

Y1 - 1992

N2 - It is shown that there is an absolute constant c with the following property: For any two graphs G1 = (V, E1) and G2 = (V, E2) on the same set of vertices, where G1 has maximum degree at most d and G2 is a vertex disjoint union of cliques of size cd each, the chromatic number of the graph G = (V, E1 U E2) is precisely cd. The proof is based on probabilistic arguments.

AB - It is shown that there is an absolute constant c with the following property: For any two graphs G1 = (V, E1) and G2 = (V, E2) on the same set of vertices, where G1 has maximum degree at most d and G2 is a vertex disjoint union of cliques of size cd each, the chromatic number of the graph G = (V, E1 U E2) is precisely cd. The proof is based on probabilistic arguments.

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

U2 - 10.1002/rsa.3240030102

DO - 10.1002/rsa.3240030102

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

AN - SCOPUS:84990648282

SN - 1042-9832

VL - 3

SP - 1

EP - 7

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 1

ER -