= Colouring number of a hereditary graph property
{title2=$r(\mathcal P)=\max\{a:\mathcal C(a,b)\subseteq\mathcal P\text{ for some }b\}$}
= Coloring number of a hereditary graph property
{synonym}
This parameter measures the largest completely unrestricted clique-independent partition class contained in the property. It is zero for bounded-order hereditary classes and infinite for all <graphs>. For proper unbounded classes it is a positive integer; it differs from the degeneracy-based colouring number of an individual <graph>.
Back to article page
