Degree sum and graph linkage with prescribed path lengths
From MaRDI portal
Publication:1730224
DOI10.1016/j.dam.2018.09.008zbMath1406.05019OpenAlexW2901328752MaRDI QIDQ1730224
Colton Magnant, Pouria Salehi Nowbandegani, Vincent E. jun. Coll
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.09.008
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on semi-linkage with almost prescribed lengths in large graphs
- Precise location of vertices on Hamiltonian cycles
- Distributing vertices along a Hamiltonian cycle in Dirac graphs
- Panconnected graphs. II
- Blow-up lemma
- Enomoto and Ota's conjecture holds for large graphs
- Placing specified vertices at precise locations on a Hamiltonian cycle
- Note on Hamilton Circuits
- An Ore-type Theorem for Perfect Packings in Graphs
This page was built for publication: Degree sum and graph linkage with prescribed path lengths