On the square of a Hamiltonian cycle in dense graphs

DOI10.1002/(SICI)1098-2418(199608/09)9:1/2%3C193::AID-RSA12%3E3.0.CO;2-PMaRDI QIDQ4894609zbMATH OpenOpenAlexFDO

Authors János Komlós, Gábor N. Sárközy

Publication date 7 October 1996

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2%3C193::aid-rsa12%3E3.0.co;2-p

zbMATH Keywords

clustersHamiltonian cycleregularity lemmasquaretriangle

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• The square of paths and cycles
• The Square of a Hamiltonian Cycle
• On a degree sequence analogue of Pósa's conjecture
• On degree sequences forcing the square of a Hamilton cycle

Cited in

(48)

• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
• Proof of the Seymour conjecture for large graphs
• On `maximal' Hamiltonian cycles in the square of a block
• Blow-up lemma
• Square Hamiltonian cycles in graphs with maximal 4-cliques
• Almost-spanning subgraphs with bounded degree in dense graphs
• The square of paths and cycles
• On multipartite Hajnal-Szemerédi theorems
• The Wiener index of signed graphs
• Monochromatic square-cycle and square-path partitions
• Spectral radius and the 2-power of Hamilton cycle
• Monochromatic cycle power partitions
• Stability for vertex cycle covers
• Local resilience for squares of almost spanning cycles in sparse random graphs
• On prisms, Möbius ladders and the cycle space of dense graphs
• Ramsey number of a connected triangle matching
• Minimum degree conditions for large subgraphs
• Forcing spanning subgraphs via Ore type conditions
• Edge growth in graph squares
• On degree sequences forcing the square of a Hamilton cycle
• On a degree sequence analogue of Pósa's conjecture
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• An Ore-type theorem on Hamiltonian square cycles
• scientific article; zbMATH DE number 3946176 (Why is no real title available?)
• Hamiltonian cycles with all small even chords
• The Square of a Hamiltonian Cycle
• scientific article; zbMATH DE number 4114680 (Why is no real title available?)
• The threshold for the square of a Hamilton cycle
• Monochromatic bounded degree subgraph partitions
• Ore-degree threshold for the square of a Hamiltonian cycle
• Dirac's condition for spanning Halin subgraphs
• An extension of the blow-up lemma to arrangeable graphs
• An extension of the Hajnal-Szemerédi theorem to directed graphs
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection
• A general approach to transversal versions of Dirac‐type theorems
• Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
• The square of a Hamilton cycle in randomly perturbed graphs
• Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
• Cyclic subsets in regular Dirac graphs
• A generalization of the Hamiltonian cycle in dense digraphs
• Packing of the k-power of Hamilton cycles
• Characterizing forbidden pairs for Hamiltonian squares
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Quadripartite version of the Hajnal-Szemerédi theorem
• On 2-factors with \(k\) components
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Distributing vertices along a Hamiltonian cycle in Dirac graphs

This page was built for publication: On the square of a Hamiltonian cycle in dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894609)