A note on the computation on the k-closure of a graph
type: Item
instance of: scholarly article
title: A note on the computation on the k-closure of a graph
zbMATH Open document ID: 0653.68072
DOI: 10.1016/0020-0190(87)90148-7
author: Jayme L. Szwarcfiter
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4066366
zbMATH Keywords: Hamilton cycles
zbMATH Keywords: closure of graph
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90148-7
OpenAlex ID: W2028291445
cites work: Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
cites work: A method in graph theory
cites work: On Hamilton's ideals
cites work: Some Theorems on Abstract Graphs
cites work: Q4057549
cites work: Q5625199
cites work: Note on Hamilton Circuits
cites work: Q5722819
description: scientific article; zbMATH DE number 4066366