On the construction and enumeration of Hamiltonian graphs
type: Item
instance of: scholarly article
title: On the construction and enumeration of Hamiltonian graphs
zbMATH Open document ID: 0790.05040
DOI: 10.1007/BF02661988
author: Guanzhang Hu
author: Minshan Li
published in: Applied Mathematics. Series B (English Edition)
publication date: 1994-06-22T00:00:00Z
review text: The authors deal with the enumeration and construction of Hamiltonian graphs and succeed in giving a formula for enumerating the equivalent classes of so-called orderly labeled Hamiltonian graphs under the dihedral group \(D_ n\), \(n\geq 3\). They conclude by presenting algorithms to generate Hamiltonian graphs recursively.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 468863
zbMATH Keywords: enumeration
zbMATH Keywords: Hamiltonian graphs
zbMATH Keywords: dihedral group
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q4115103
cites work: Orderly algorithms for graph generation
full work available at URL: https://doi.org/10.1007/bf02661988
OpenAlex ID: W2048579695
description: scientific article; zbMATH DE number 468863