How does the chromatic number of a random graph vary?

<p>The chromatic number &chi;(G) of a graph G is a fundamental parameter, whose study was originally motivated by applications (&chi;(G) is the minimum number of internally compatible groups the vertices can be divided into, if the edges represent incompatibility). As with other graph...

Full description

Bibliographic Details
Main Authors: Heckel, A, Riordan, O
Format: Journal article
Language:English
Published: Wiley 2023