Point partition numbers: perfect graphs

Justus von Postel, Thomas Schweser, Michael Stiebitz

Graphs considered in this paper are finite, undirected and without loops, but with multiple edges. For an integer $t\ge 1$, denote by ${\mathcal{M}\mathcal{G}}_t$ the class of graphs whose ma…