Dominating cycles in regular 3-connected graphs
type: Item
instance of: scholarly article
title: Dominating cycles in regular 3-connected graphs
zbMATH Open document ID: 0756.05075
DOI: 10.1016/0012-365X(92)90051-G
author: Bill Jackson
author: Hao Li
author: Yongjin Zhu
published in: Discrete Mathematics
publication date: 1992-09-27T00:00:00Z
review text: The authors conjecture that every 3-connected, \(k\)-regular graph on at most \(4k\) vertices is Hamiltonian for \(k\geq 4\). They prove the weaker statement that every longest cycle is dominating provided \(k\geq 63\).
reviewed by: Carsten Thomassen
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 65062
zbMATH Keywords: dominating cycles
zbMATH Keywords: regular 3-connected graphs
zbMATH Keywords: Hamiltonian
MaRDI profile type: Publication
cites work: Hamiltonian Cycles in Regular Graphs
cites work: A method in graph theory
cites work: Q5422499
cites work: Hamiltonian cycles in regular graphs of moderate degree
cites work: Longest cycles in regular graphs
cites work: Hamilton cycles in regular 2-connected graphs
cites work: Q3680861
cites work: Q4726284
full work available at URL: 0012-365x(92)90051-g
OpenAlex ID: W1983571890
description: scientific article; zbMATH DE number 65062