Complexity of the hamiltonian cycle in regular graph problem
type: Item
instance of: scholarly article
title: Complexity of the hamiltonian cycle in regular graph problem
zbMATH Open document ID: 0809.68091
DOI: 10.1016/0304-3975(94)90185-6
published in: Theoretical Computer Science
publication date: 1995-03-20T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 626283
zbMATH Keywords: hamiltonian cycle
zbMATH Keywords: NP-complete problem
author: Christophe Picouleau
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90185-6
OpenAlex ID: W1977187614
cites work: Q4198056
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Q3941433
Recommended article: Hamiltonian cycles in regular graphs
Recommended article: Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Recommended article: On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
Recommended article: Q3481737
Recommended article: On the Minimum Number of Hamiltonian Cycles in Regular Graphs
Recommended article: Q4294613
Recommended article: Complexity of Hamiltonian cycle reconfiguration
Recommended article: Q4601890
Recommended article: Hamiltonian cycles in regular graphs of moderate degree
Recommended article: Hamiltonicity in connected regular graphs
description: scientific article; zbMATH DE number 626283