On path-coverings and Hamilton-connectivity of finite graphs
type: Item
instance of: scholarly article
title: On path-coverings and Hamilton-connectivity of finite graphs
zbMATH Open document ID: 0452.05049
DOI: 10.1007/BF01223726
author: Norbert Köhler
published in: Archiv der Mathematik
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 3706499
zbMATH Keywords: hamiltonian connectivity
zbMATH Keywords: path-coverings
MaRDI profile type: Publication
cites work: On maximal paths and circuits of graphs
cites work: On Maximal Circuits in Finite Graphs
cites work: A note on K-path hamiltonian graphs
cites work: Arc coverings of graphs
cites work: Note on Hamilton Circuits
full work available at URL: https://doi.org/10.1007/bf01223726
OpenAlex ID: W2086499469
description: scientific article; zbMATH DE number 3706499