How does the chromatic number of a random graph vary?
<p>The chromatic number χ(G) of a graph G is a fundamental parameter, whose study was originally motivated by applications (χ(G) is the minimum number of internally compatible groups the vertices can be divided into, if the edges represent incompatibility). As with other graph...
Main Authors: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Wiley
2023
|