Well-hued graphs

by | Okt 11, 2021 | Seminar iz diskretne matematike

Predavateljica: Kirsti Kuenzel (Trinity College, Hartford, CT, ZDA) A graph $G$ is called well-hued if for each positive integer $k$ there is an integer $a_k$ such that every maximal $k$-colorable subgraph of $G$ has order $a_k$. This notion of well-hued can be viewed...
Accessibility