Four sufficient conditions for hamiltonian graphs
type: Item
instance of: scholarly article
title: Four sufficient conditions for hamiltonian graphs
zbMATH Open document ID: 0727.05038
DOI: 10.1016/0012-365X(91)90367-B
published in: Discrete Mathematics
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 4200242
zbMATH Keywords: hamiltonian circuits
author: Ahmed Ainouche
MaRDI profile type: Publication
cites work: Semi-independence number of a graph and the existence of Hamiltonian circuits
cites work: An improvement of fraisse's sufficient condition for hamiltonian graphs
cites work: Note on Hamilton Circuits
cites work: Q3474676
cites work: Neighbourhood unions and Hamiltonian properties in graphs
cites work: Hamiltonian properties of graphs with large neighborhood unions
cites work: One sufficient condition for hamiltonian graphs
cites work: Hamiltonism, degree sum and neighborhood intersections
cites work: A new sufficient condition for hamiltonian graphs
Recommended article: Q3035325
Recommended article: Q4852568
Recommended article: A sufficient condition for Hamilton graphs
Recommended article: Necessary and sufficient conditions for a Hamiltonian graph
Recommended article: Hamiltonicity of 4-connected graphs
Recommended article: Q5453433
Recommended article: Q4439419
Recommended article: Q4500442
Recommended article: A new sufficient condition for Hamiltonian graphs
description: scientific article; zbMATH DE number 4200242