Point partition numbers: perfect graphs

13 Mar 2020 von Postel Justus Schweser Thomas Stiebitz Michael

Graphs considered in this paper are finite, undirected and without loops, but with multiple edges. For an integer $t\geq 1$, denote by $\mathcal{MG}_t$ the class of graphs whose maximum multiplicity is at most $t$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS