1 M.A. Bonuccelli, "Minimum node disjoint path covering for circular-arc graphs" 8 : 159-161, 1979
2 A.Itai, "Hamiltonian paths in grid graphs" 11 : 676-686, 1998
3 A.A. Bertossi, "Hamiltonian circuits in interval graph generalizations" 23 : 195-200, 1986
4 F.T. Boesch, "Covering the points of a digraph with point disjoint paths and its application to code optimization" 24 (24): 192-198, 1977
5 M.R. Garey, "Computers and Intractability: A guide to the theory of NP-completeness" Freeman 1979
1 M.A. Bonuccelli, "Minimum node disjoint path covering for circular-arc graphs" 8 : 159-161, 1979
2 A.Itai, "Hamiltonian paths in grid graphs" 11 : 676-686, 1998
3 A.A. Bertossi, "Hamiltonian circuits in interval graph generalizations" 23 : 195-200, 1986
4 F.T. Boesch, "Covering the points of a digraph with point disjoint paths and its application to code optimization" 24 (24): 192-198, 1977
5 M.R. Garey, "Computers and Intractability: A guide to the theory of NP-completeness" Freeman 1979