Hamiltonian prisms on 5-chordal graphs
Combinatorics
2016-03-07 v1
Authors:
Mou Gao
Abstract
In this paper, we provide a method to find a Hamiltonian cycle in the prism of a 5-chordal graph, which is (1+ϵ)-tough, with some special conditions.
Keywords
Cite
@article{arxiv.1603.01371,
title = {Hamiltonian prisms on 5-chordal graphs},
author = {Mou Gao},
journal= {arXiv preprint arXiv:1603.01371},
year = {2016}
}
Related papers
View all related →
Combinatorics · Mathematics
An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs
Bohao Yao, Charl Ras, Hamid Mokhtar
2015-12-07
Computational Complexity · Computer Science
The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations
Kaiying Hou, Jayson Lynch
2018-05-09
Combinatorics · Mathematics
10-tough chordal graphs are Hamiltonian
Adam Kabela, Tomáš Kaiser
2016-07-05
Combinatorics · Mathematics
A quotient-lifting approach to the Hamiltonicity of the cylindrical 5-puzzle graph
Taizo Sadahiro
2025-11-17
Computational Complexity · Computer Science
Hamiltonicity in Semi-Regular Tessellation Dual Graphs
Divya Gopinath, Rohan Kodialam, Kevin Lu, Jayson Lynch +1
2019-10-01
Data Structures and Algorithms · Computer Science
A more efficient way of finding Hamiltonian cycle
Paweł Kaftan
2022-08-25
Data Structures and Algorithms · Computer Science
The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
Guohun Zhu
2007-06-20
Data Structures and Algorithms · Computer Science
Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
Andreas Björklund, Petteri Kaski, Jesper Nederlof
2024-02-23
Discrete Mathematics · Computer Science
A '1+1' Algorithm for the Hamilton Cycle Problem
Heping Jiang
2020-11-17
Discrete Mathematics · Computer Science
A New Property of Hamilton Graphs
Heping Jiang
2015-08-04
Combinatorics · Mathematics
Counting Hamilton cycles in Dirac hypergraphs
Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn +1
2021-07-01
Combinatorics · Mathematics
Finding Hamilton cycles in random graphs with few queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
2016-08-05
Combinatorics · Mathematics
Hamilton cycles in tough $(2P_2 \cup P_1)$-free graphs
Songling Shan, Arthur Tanyel
2025-06-17
Combinatorics · Mathematics
Hamiltonian cycles in $k$-partite graphs
Louis DeBiasio, Robert A. Krueger, Dan Pritikin, Eli Thompson
2019-10-10
Combinatorics · Mathematics
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
Alan Frieze, Simi Haber
2012-10-24
Discrete Mathematics · Computer Science
Upper Bounds for the Number of Hamiltonian Cycles
Jinshan Zhang
2008-12-06
Combinatorics · Mathematics
Tight Hamiltonicity from dense links of triples
Richard Lang, Mathias Schacht, Jan Volec
2025-07-31
Combinatorics · Mathematics
Contractible Hamiltonian Cycles in Polyhedral Maps
Dipendu Maity, Ashish Kumar Upadhyay
2012-02-21
Combinatorics · Mathematics
On the Minimum Number of Hamiltonian Cycles in Regular Graphs
Michael Haythorpe
2016-08-03
Combinatorics · Mathematics
On the number of Hamilton cycles in pseudo-random graphs
Michael Krivelevich
2012-01-10
Combinatorics · Mathematics
Tight Hamilton Cycles in Random Uniform Hypergraphs
Andrzej Dudek, Alan Frieze
2011-07-27
Statistical Mechanics · Physics
Finding long cycles in graphs
Enzo Marinari, Guilhem Semerjian, Valery Van Kerrebroeck
2007-07-03
Combinatorics · Mathematics
On the number of Hamiltonian cycles and polynomial invariants of graphs
Yi Bo
2017-06-30
Combinatorics · Mathematics
Hamilton and long cycles in $t$-tough graphs with $t>1$
Zh. G. Nikoghosyan
2012-03-19
Combinatorics · Mathematics
Hamilton cycles in dense vertex-transitive graphs
Demetres Christofides, Jan Hladký, András Máthé
2017-07-31