Overview

coloring of graphs


Related Overviews

 

More Like This

Show all results sharing this subject:

  • Computing

GO

Show Summary Details

Quick Reference

An assignment (of colors) to the vertices of a graph in such a way that adjacent vertices are assigned different colors. The minimum number of colors needed to color a graph is known as the graph's chromatic number.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.