On a Hamiltonian cycle in which specified vertices are uniformly distributed

DOI10.1006/jctb.2000.1999zbMath1027.05057OpenAlexW2064737922MaRDI QIDQ1850512

Atsushi Kaneko, Kiyoshi Yoshimoto

Publication date: 10 December 2002

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

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

zbMATH Keywords

shortest pathdistance

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Distributing pairs of vertices on Hamiltonian cycles ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On degree sum conditions for directed path-factors with a specified number of paths ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ Note on locating pairs of vertices on Hamiltonian cycles ⋮ Locating any two vertices on Hamiltonian cycles in large graphs ⋮ Distributing vertices on Hamiltonian cycles ⋮ A look at cycles containing specified elements of a graph

Cites Work

• On a 2-factor with a specified edge in a graph satisfying the Ore condition
• Degree conditions for 2-factors
• Some Theorems on Abstract Graphs