Precise location of vertices on Hamiltonian cycles

DOI10.1016/j.disc.2013.08.012zbMath1280.05073OpenAlexW1971776397MaRDI QIDQ394220

Ralph J. Faudree, Ronald J. Gould

Publication date: 24 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.012

zbMATH Keywords

Hamiltonian cycleminimum degreevertex location

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (5)

Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Degree sum and graph linkage with prescribed path lengths ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Locating pairs of vertices on a Hamiltonian cycle in bigraphs
• Distributing vertices along a Hamiltonian cycle in Dirac graphs
• Panconnected graphs. II
• Distributing vertices on Hamiltonian cycles
• Some Theorems on Abstract Graphs

This page was built for publication: Precise location of vertices on Hamiltonian cycles