On graph closures
type: Item
instance of: scholarly article
title: On graph closures
zbMATH Open document ID: 1021.05059
DOI: 10.1016/S0012-365X(02)00573-3
published in: Discrete Mathematics
publication date: 2003-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1985956
zbMATH Keywords: claw-free graph
zbMATH Keywords: circumference
zbMATH Keywords: Hamiltonian path
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: closure
author: Alexander Kelmans
MaRDI profile type: Publication
full work available at URL: s0012-365x(02)00573-3
OpenAlex ID: W2028806435
Recommended article: On computing graph closures
Recommended article: Q3481738
Recommended article: On the closed graph theorem
Recommended article: A note on computing graph closures
Recommended article: On \(m\)-closed graphs
Recommended article: On closed graphs. I
Recommended article: On the computational complexity of graph closures
Recommended article: Q4201576
Recommended article: The complete closure of a graph
Recommended article: Closure and factor-critical graphs
description: scientific article; zbMATH DE number 1985956