Locating pairs of vertices on a Hamiltonian cycle in bigraphs

DOI10.1007/s00373-015-1626-2zbMath1338.05148OpenAlexW1735997119MaRDI QIDQ293624

Kiyoshi Yoshimoto, Jenő Lehel, Ralph J. Faudree

Publication date: 9 June 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1626-2

zbMATH Keywords

bipartite graphHamiltonian cycleEnomoto conjecturepanconnected bigraph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

A panconnectivity theorem for bipartite graphs ⋮ Precise location of vertices on Hamiltonian cycles ⋮ Recent advances on the Hamiltonian problem: survey III

Cites Work

• Unnamed Item
• Unnamed Item
• Locating pairs of vertices on Hamiltonian cycles
• Note on locating pairs of vertices on Hamiltonian cycles
• Long cycles in bipartite graphs
• Panconnected graphs. II
• A panconnectivity theorem for bipartite graphs

This page was built for publication: Locating pairs of vertices on a Hamiltonian cycle in bigraphs