2
$\begingroup$

For any $k \ge 3$ construct a non hamiltonian, connected, $k$-homogeneous and two sided graph.

I tried to use induction, but couldn't construct for $k=3$ or $4$.

Any hints or advices appreciated

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.