Hamilton cycles in regular 3-connected graphs
type: Item
instance of: scholarly article
title: Hamilton cycles in regular 3-connected graphs
zbMATH Open document ID: 0774.05063
DOI: 10.1016/0012-365X(92)90712-O
published in: Discrete Mathematics
publication date: 1993-05-16T00:00:00Z
review text: Let \(G\) be a 3-connected \(k\)-regular graph on \(n\) vertices. It is known that \(G\) is Hamiltonian if \(k\geq 14\) and \(n\leq 3k+4\), and it has been conjectured that even \(k\geq 4\) and \(n\geq 4k\) imply Hamiltonicity. In the present paper it is shown that \(G\) is Hamiltonian if \(k\geq 63\) and \(n\leq{22\over 7}k\).
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 166365
zbMATH Keywords: Hamiltonian graphs
zbMATH Keywords: Hamilton cycles
zbMATH Keywords: regular graph
zbMATH Keywords: Hamiltonicity
author: Yongjin Zhu
author: Hao Li
reviewed by: Erich Prisner
MaRDI profile type: Publication
cites work: Hamiltonian Cycles in Regular Graphs
cites work: Q5422499
cites work: Hamiltonian cycles in regular graphs of moderate degree
cites work: Hamilton cycles in regular 2-connected graphs
cites work: Dominating cycles in regular 3-connected graphs
cites work: Q4040392
cites work: The binding number of a graph and its Anderson number
cites work: Q4726284
full work available at URL: 0012-365x(92)90712-o
OpenAlex ID: W1963734119
description: scientific article; zbMATH DE number 166365