The square of paths and cycles

DOI10.1006/jctb.1995.1005zbMath0826.05040OpenAlexW2066235086MaRDI QIDQ1892831

Geng-Hua Fan, Henry A. Kierstead

Publication date: 2 July 1995

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

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

zbMATH Keywords

Hamiltonian cycleHamiltonian pathsquare of a cyclesquare of a path

Mathematics Subject Classification ID

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

Related Items (19)

Edge ideals of squares of trees ⋮ Minimum Degrees for Powers of Paths and Cycles ⋮ Monochromatic cycle power partitions ⋮ Saturation problems with regularity constraints ⋮ On a degree sequence analogue of Pósa's conjecture ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Square Hamiltonian cycles in graphs with maximal 4-cliques ⋮ Hamiltonian cycles with all small even chords ⋮ Characterizing forbidden pairs for Hamiltonian squares ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Pósa's conjecture for graphs of order at least 2 × 10⁸ ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ 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 ⋮ Proof of the Seymour conjecture for large graphs ⋮ Monochromatic square-cycle and square-path partitions ⋮ Spectral radius and the 2-power of Hamilton cycle

This page was built for publication: The square of paths and cycles