Artificial intelligent assistant

Polyhedral graph such that every vertex has degree $2k$, for some $k > 2$ Is there any polyhedral graph such that every vertex has degree even greater than 4?

If a graph's every vertex has degree of at least $6$, then it cannot be planar graph because it needs to satisfy Euler's formula.

See this MO question's comment by Noam Elkies for details.

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy fb684b21dea4f794c2cfe49c92fe924b