1
$\begingroup$

Let G be a simple directed graph and h(G) - number of hamiltonian paths in it. Let H be addition of G to complete digraph. Prove that h(G) and h(H) have the same parity. Can you give me a hint how to start, please?

$\endgroup$
1
  • $\begingroup$ What do you mean by addition of two graphs? $\endgroup$
    – H. Walter
    Nov 21 '20 at 18:40

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.