Hamiltonian square-paths

DOI10.1006/jctb.1996.0039zbMath0858.05066OpenAlexW2093397072MaRDI QIDQ1924142

Henry A. Kierstead, Geng-Hua Fan

Publication date: 14 October 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0039

zbMATH Keywords

minimum degreehamiltonian path

Mathematics Subject Classification ID

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

Related Items (24)

Minimum Degrees for Powers of Paths and Cycles ⋮ Monochromatic cycle power partitions ⋮ On a degree sequence analogue of Pósa's conjecture ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Stability for vertex cycle covers ⋮ Square Hamiltonian cycles in graphs with maximal 4-cliques ⋮ Graphs containing every 2-factor ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Characterizing forbidden pairs for Hamiltonian squares ⋮ A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Pósa's conjecture for graphs of order at least 2 × 10⁸ ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Forbidden subgraphs for a graph to have a Hamiltonian path square ⋮ Monochromatic bounded degree subgraph partitions ⋮ How to avoid using the regularity Lemma: Pósa's conjecture revisited ⋮ The Wiener index of signed graphs ⋮ Proof of the Seymour conjecture for large graphs ⋮ Monochromatic square-cycle and square-path partitions ⋮ Dirac's Condition for Spanning Halin Subgraphs ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Embedding Graphs Having Ore-Degree at Most Five ⋮ Large planar subgraphs in dense graphs

This page was built for publication: Hamiltonian square-paths