![](/files/happy5.png)
Melnikov, L. S.
Melnikov's valency-variety problem ★
Author(s): Melnikov
Problem The valency-variety
of a graph
is the number of different degrees in
. Is the chromatic number of any graph
with at least two vertices greater than
![$ w(G) $](/files/tex/a1ba1262a44dc4c4c585e3e1854ea2218cd40629.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$$\ceil{ \frac{\floor{w(G)/2}}{|V(G)| - w(G)} } ~ ?$$](/files/tex/90d7d0498914cd55d9d67b5608aa716bfcb06880.png)
Keywords:
![Syndicate content Syndicate content](/misc/feed.png)