Legal coloring of graphs

N. Linial*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


The following computational problem was initiated by Manber and Tompa (22nd FOCS Conference, 1981): Given a graph G=(V, E) and a real function f:V→R which is a proposed vertex coloring. Decide whether f is a proper vertex coloring of G. The elementary steps are taken to be linear comparisons. Lower bounds on the complexity of this problem are derived using the chromatic polynomial of G. It is shown how geometric parameters of a space partition associated with G influence the complexity of this problem. Existing methods for analyzing such space partitions are suggested as a powerful tool for establishing lower bounds for a variety of computational problems.

Original languageAmerican English
Pages (from-to)49-54
Number of pages6
Issue number1
StatePublished - Mar 1986


  • AMS subject classification (1980): 68C25, 05C15


Dive into the research topics of 'Legal coloring of graphs'. Together they form a unique fingerprint.

Cite this