DAG Hamiltonian Path NP-complete
Your proposed approach doesn't work.  For some directed graphs there is no single vertex you can split to turn it into a DAG.  An algorithm only qualifies as a solution to the Hamiltonian Cycle problem if it solves the problem for all graphs.  It's not enough to solve the problem for a subset of "easy" graphs.