Note on semi-linkage with almost prescribed lengths in large graphs

DOI10.1007/s00373-015-1631-5zbMath1339.05196OpenAlexW2137620080MaRDI QIDQ293607

Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani

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-1631-5

zbMATH Keywords

distancegraph linkage

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Degree sum and graph linkage with prescribed path lengths ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Precise location of vertices on Hamiltonian cycles
• Note on Enomoto and Ota's conjecture for short paths in large graphs
• Note on locating pairs of vertices on Hamiltonian cycles
• Blow-up lemma
• Enomoto and Ota's conjecture holds for large graphs
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• An asymptotic version of a conjecture by Enomoto and Ota
• Distributing vertices on Hamiltonian cycles
• Note on Hamilton Circuits
• An Ore-type Theorem for Perfect Packings in Graphs
• Partitions of a graph into paths with prescribed endvertices and lengths