Note on locating pairs of vertices on Hamiltonian cycles

DOI10.1007/s00373-013-1325-9zbMath1298.05190OpenAlexW2021936327MaRDI QIDQ742600

Ralph J. Faudree, Kiyoshi Yoshimoto, Jenő Lehel

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1325-9

zbMATH Keywords

Hamiltonian cycledominating cyclepanconnected graphEnomoto's conjecture

Mathematics Subject Classification ID

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

Related Items

Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Locating pairs of vertices on a Hamiltonian cycle in bigraphs ⋮ Locating sets of vertices on Hamiltonian cycles ⋮ Distributing pairs of vertices on Hamiltonian cycles ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle ⋮ Locating any two vertices on Hamiltonian cycles in large graphs

Cites Work

• Distributing vertices along a Hamiltonian cycle in Dirac graphs
• Panconnected graphs. II
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• On Hamiltonian bipartite graphs
• Distributing vertices on Hamiltonian cycles
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item