Note on semi-linkage with almost prescribed lengths in large graphs
From MaRDI portal
Publication:293607
DOI10.1007/S00373-015-1631-5zbMATH Open1339.05196OpenAlexW2137620080MaRDI QIDQ293607FDOQ293607
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
Recommendations
Cites Work
- Title not available (Why is that?)
- An Ore-type Theorem for Perfect Packings in Graphs
- Title not available (Why is that?)
- Note on Hamilton Circuits
- 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
- Precise location of vertices on Hamiltonian cycles
- Partitions of a graph into paths with prescribed endvertices and lengths
- Note on Enomoto and Ota's conjecture for short paths in large graphs
- Title not available (Why is that?)
- Note on locating pairs of vertices on Hamiltonian cycles
Cited In (3)
This page was built for publication: Note on semi-linkage with almost prescribed lengths in large graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293607)