Placing Specified Vertices at Precise Locations on a Hamiltonian CycleGraphs and Combinatorics
Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large graphs.
Citation InformationRonald Gould, Colton Magnant and Pouria Salehi Nowbandegani. "Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle" Graphs and Combinatorics Vol. 33 Iss. 2 (2017) p. 369 - 385 ISSN: 1435-5914
Available at: http://works.bepress.com/colton_magnant/63/