Hamiltonian cycles and dominating cycles passing through a linear forest
type: Item
instance of: scholarly article
title: Hamiltonian cycles and dominating cycles passing through a linear forest
zbMATH Open document ID: 1198.05108
author: Kenta Ozeki
author: Tomoki Yamashita
published in: Discrete Mathematics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5565696
zbMATH Keywords: degree sum
zbMATH Keywords: connectivity
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: dominating cycle
zbMATH Keywords: linear forest
MaRDI profile type: Publication
full work available at URL: j.disc.2008.02.031
OpenAlex ID: W2065854866
cites work: A generalization of a result of Häggkvist and Nicoghossian
cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
cites work: Q4871748
cites work: A look at cycles containing specified elements of a graph
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Circuits through specified edges
cites work: Generalization of a Theorem of Posa
cites work: Note on Hamilton Circuits
cites work: Q5342985
DOI: 10.1016/J.DISC.2008.02.031
description: scientific article; zbMATH DE number 5565696