论文信息 - Pancyclicity and NP-completeness in Planar Graphs - 字舞流文

Pancyclicity and NP-completeness in Planar Graphs

Mingchu Li | Derek G. Corneil | Eric Mendelsohn | D. Corneil | E. Mendelsohn | Mingchu Li

[1] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[4] J. Malkevitch. On the lengths of cycles in planar graphs , 1971 .