Note on Enomoto and Ota's conjecture for short paths in large graphs
From MaRDI portal
Publication:489313
DOI10.1007/s00373-013-1351-7zbMath1306.05190OpenAlexW2024548810WikidataQ123139644 ScholiaQ123139644MaRDI QIDQ489313
Colton Magnant, Martin Hall, Hua Wang
Publication date: 20 January 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1351-7
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex degrees (05C07)
Related Items (2)
Note on semi-linkage with almost prescribed lengths in large graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Cites Work
This page was built for publication: Note on Enomoto and Ota's conjecture for short paths in large graphs