Point partition numbers: decomposable and indecomposable critical graphs

Justus von Postel, Thomas Schweser, Michael Stiebitz

Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number ${\chi }_t(G)$ is the least integer $k$ for which $G$ admits…