On the square of a Hamiltonian cycle in dense graphs

J�nos Koml�s, G�bor N. S�rk�zy, Endre Szemer�di

Type: Article

Publication Date: 1996-08-01

Citations: 83

DOI: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<193::aid-rsa12>3.0.co;2-p

View Publication

Locations

Random Structures and Algorithms - View

Similar Works

Action	Title	Year	Authors
+	Hamiltonian Cycles in Sparse Graphs	2004	Alexander Hertel
+	Dense graphs with small clique number	2010	Wayne Goddard Jeremy Lyle
+	The threshold for the square of a Hamilton cycle	2020	Jeff Kahn Bhargav Narayanan Jinyoung Park
+	Edge-disjoint Hamilton cycles in random graphs	2013	Fiachra Knox Daniela Kühn Deryk Osthus
+	The threshold for the square of a Hamilton cycle	2020	Jeff Kahn Bhargav Narayanan Jinyoung Park
+	Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk	2000	B. Bollob�s Colin Cooper Trevor Fenner Alan Frieze
+	On Hamiltonian Regular Graphs of Girth Six	1967	William G. Brown
+	Sparse Graphs	1994	Tommy R. Jensen Bjarne Toft
+ PDF Chat	Trees with Hamiltonian square	1971	Frank Harary Allen J. Schwenk
+	The threshold for the square of a Hamilton cycle	2020	Jeff Kahn Bhargav Narayanan Jinyoung Park
+	Partitioning a graph into two square‐cycles	1996	Genghua Fan H. A. Kierstead
+	On minimal imperfect graphs with circular symmetry	1998	Gábor Bacsó Endre Boros Vladimir Gurvich Frédéric Maffray Myriam Preissmann
+	Triangle-free graphs that are signable without even holes	2000	Michele Conforti G�rard Cornu�jols Ajai Kapoor Kristina Vu kovi
+	An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs	2020	Andreas Björklund
+	An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs	2021	Andreas Björklund
+ PDF Chat	Independence trees and Hamilton cycles	1998	Hajo Broersma Hilde Tuinstra
+	Hamiltonian Cycles in Graphs	1989	Zhenhong Liu Yongjin Zhu Feng Tian
+ PDF Chat	An explicit construction of graphs of bounded degree that are far from being Hamiltonian	2022	Isolde Adler Noleen Köhler
+ PDF Chat	On Degree Sequences Forcing The Square of a Hamilton Cycle	2017	Katherine Staden Andrew Treglown
+	A Study of Barnettes Conjecture on Hamiltonian Graphs	2018	Mushtaq Ahmad Shah

Works That Cite This (77)

Action	Title	Year	Authors
+	Spectral radius and the 2-power of Hamilton cycle	2022	Xinru Yan Xiaocong He Lihua Feng Weijun Liu
+	Proof of the Seymour Conjecture for Large Graphs	1998	Endre Szemer
+ PDF Chat	On k‐ordered Hamiltonian graphs	1999	H. A. Kierstead Gábor N. Sárközy Stanley M. Selkow
+	Forcing spanning subgraphs via Ore type conditions	2009	Julia Böttcher Sybille Müller
+ PDF Chat	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF Chat	Ramsey Number of a Connected Triangle Matching	2015	András Gyárfás Gábor N. Sárközy
+	Spectral extremal problem on the square of ℓ-cycle	2024	Longfei Fang Yanhua Zhao
+ PDF Chat	On Sufficient Conditions for Hamiltonicity in Dense Graphs	2021	Richard Lang Nicolás Sanhueza‐Matamala
+	Extremal Hypergraph Theory and Algorithmic Regularity Lemma for Sparse Graphs	2010	Rerum Naturalium Mathematisch-Naturwissenschaftlichen Fakultät
+ PDF Chat	Dirac's Condition for Spanning Halin Subgraphs	2019	Guantao Chen Songling Shan

Works Cited by This (0)

Action	Title	Year	Authors