Hamilton cycles in sparse locally connected graphs
type: Item
instance of: scholarly article
title: Hamilton cycles in sparse locally connected graphs
zbMATH Open document ID: 1406.05060
author: Susan Van Aardt
author: A. P. Burger
author: Marietjie Frick
author: Carsten Thomassen
author: Johan P. de Wet
published in: Discrete Applied Mathematics
publication date: 2019-03-11T00:00:00Z
full work available at URL: 1 s2.0 S0166218X1830578X main.pdf
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7034228
zbMATH Keywords: locally connected
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: NP-completeness
zbMATH Keywords: polynomial time algorithm
MaRDI profile type: Publication
OpenAlex ID: W2901123556
cites work: Q5422499
cites work: Locally connected graphs
cites work: Q3958496
cites work: Hamiltonian properties of locally connected graphs with bounded vertex degree
cites work: A strengthening of Kikustapos;s theorem
cites work: Extending cycles in graphs
cites work: Q4090366
cites work: Complexity of the hamiltonian cycle in regular graph problem
DOI: 10.1016/J.DAM.2018.10.031
Wikidata QID: Q128942454
Recommended article: Q4311473
Recommended article: On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints
Recommended article: A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs
Recommended article: Hamilton Cycles in Planar Locally Finite Graphs
Recommended article: Q4468754
Recommended article: The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs
Recommended article: Finding Hamilton cycles in sparse random graphs
Recommended article: On the Number of Hamilton Cycles in Sparse Random Graphs
Recommended article: Hamilton cycles in sparse robustly expanding digraphs
Recommended article: Q3481737
description: scientific article; zbMATH DE number 7034228