Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle

Document Type

Article

Publication Date

3-2017

Publication Title

Graphs and Combinatorics

DOI

10.1007/s00373-017-1762-y

ISSN

1435-5914

Abstract

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.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 2
  • Usage
    • Abstract Views: 2
  • Captures
    • Readers: 2
see details

Share

COinS