Is there any way to know that a digraph has odd nubmer of hampaths if hamiltonian paths exist?
Just curious.