Chromatic number and complete graph substructures for degree sequences

Zdenek Dvorak, Bojan Mohar

Given a graphic degree sequence $D$, let $\chi (D)$ (respectively $\omega (D)$, $h(D)$, and $H(D)$) denote the maximum value of the chromatic number (respectively, the size of the largest cl…