A sufficient condition for a graph to be Hamiltonian
type: Item
instance of: scholarly article
title: A sufficient condition for a graph to be Hamiltonian
zbMATH Open document ID: 0461.05043
DOI: 10.1007/BF01303743
author: Norbert Köhler
published in: Monatshefte für Mathematik
publication date: 1981-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/178037
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 3720952
zbMATH Keywords: Hamiltonian graphs
MaRDI profile type: Publication
cites work: On Maximal Circuits in Finite Graphs
cites work: Maximale Kreise in Graphen
cites work: On path-coverings and Hamilton-connectivity of finite graphs
cites work: Note on Hamilton Circuits
OpenAlex ID: W2007310910
description: scientific article; zbMATH DE number 3720952