A clique-covering sufficient condition for hamiltonicity of graphs
type: Item
instance of: scholarly article
title: A clique-covering sufficient condition for hamiltonicity of graphs
zbMATH Open document ID: 1197.05083
author: Alain Bretto
author: Thierry Vallée
published in: Information Processing Letters
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5777507
zbMATH Keywords: design of algorithms
zbMATH Keywords: graph theory
zbMATH Keywords: Hamiltonian problem
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: clique decomposition condition
zbMATH Keywords: hamiltonicity
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.07.015
OpenAlex ID: W2041541789
cites work: Toughness in graphs -- a survey
cites work: Some Theorems on Abstract Graphs
cites work: Claw-free graphs---a survey
cites work: Sufficient conditions for a graph to be Hamiltonian
cites work: Updating the hamiltonian problem—A survey
cites work: Advances on the Hamiltonian problem -- a survey
DOI: 10.1016/J.IPL.2009.07.015
description: scientific article; zbMATH DE number 5777507