The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.58, Iss.3, 1999-06, pp. : 641-647

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Graphs generalizing closed curves with linear construction of the Hamiltonian cycle - Parametrization of discretized curves

By Malgouyres R.

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 189-249

Elsevier

Access to resources Recommend Favorite

On max cut in cubic graphs

By Calamoneri Tiziana

Parallel Algorithms and Applications, Vol. 17, Iss. 3, 2001-01 ,pp. : 165-183

Taylor & Francis Ltd

Access to resources Recommend Favorite

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

By Chen Y-Chuang Huang Yong-Zen Hsu Lih-Hsing Tan Jimmy

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 229-238

Springer Publishing Company

Access to resources Recommend Favorite

Finding houses and holes in graphs

By Hoang C.T. Sritharan R.

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 233-244

Elsevier

Access to resources Recommend Favorite

Finding Hamiltonian paths in tournaments on clusters

By Huang Chun-Hsi Rajasekaran Sanguthevar Yang Laurence He Xin

Cluster Computing, Vol. 9, Iss. 3, 2006-07 ,pp. : 345-353

Springer Publishing Company

Access to resources Recommend Favorite