Well-hued graphs with first difference two

Geoffrey Boyer, Kirsti Kuenzel, Jeremy Lyle +1

A graph $G$ is said to be well-hued if every maximal $k$-colorable subgraph of $G$ has the same order $a_k$. Therefore, if $G$ is well-hued, we can associate with $G$ a sequence $\…