I am trying to show a different form of Hamiltonian cycle problem is NP Hard. The problem is as follows.
We have a directed graph and each node can have at most 3 outgoing edges. Determine if this graph has a Hamiltonian cycle.
Is this problem NP hard?
I just need to find a problem to reduce to my problem but could achieve to find none.
3SAT looks friendly to me as it has 3-termed clauses but no more I progressed.
