A linear algorithm for the Hamiltonian completion number of the line graph of a tree
暂无分享,去创建一个
[1] S. Hedetniemi,et al. On the hamiltonian completion problem , 1974 .
[2] Sukhamay Kundu,et al. A Linear Algorithm for the Hamiltonian Completion Number of a Tree , 1976, Inf. Process. Lett..
[3] Alessandro Agnetis,et al. Set-Up Coordination between Two Stages of a Supply Chain , 2001, Ann. Oper. Res..
[4] Arundhati Raychaudhuri. The Total Interval Number of a Tree and the Hamiltonian Completion Number of its Line Graph , 1995, Inf. Process. Lett..
[5] Henk Jan Veldman. A result on Hamiltonian line graphs involving restrictions on induced subgraphs , 1988, J. Graph Theory.
[6] Alan A. Bertossi,et al. The Edge Hamiltonian Path Problem is NP-Complete , 1981, Inf. Process. Lett..