Placing specified vertices at precise locations on a Hamiltonian cycle

DOI10.1007/s00373-017-1762-yzbMath1368.05091OpenAlexW2577580044MaRDI QIDQ2014220

Pouria Salehi Nowbandegani, Colton Magnant, Ronald J. Gould

Publication date: 10 August 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1762-y

zbMATH Keywords

distanceregularity lemmaHamiltonian cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items

Degree sum and graph linkage with prescribed path lengths ⋮ Enomoto and Ota's conjecture holds for large graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Note on semi-linkage with almost prescribed lengths in large graphs
• Precise location of vertices on Hamiltonian cycles
• Locating pairs of vertices on Hamiltonian cycles
• Note on locating pairs of vertices on Hamiltonian cycles
• Distributing vertices along a Hamiltonian cycle in Dirac graphs
• Panconnected graphs. II
• Blow-up lemma
• Enomoto and Ota's conjecture holds for large graphs
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• Distributing vertices on Hamiltonian cycles
• Note on Hamilton Circuits
• An Ore-type Theorem for Perfect Packings in Graphs