On Extremal Graphs With No Long Paths

  • Asad Ali Ali
  • William Staton
DOI: https://doi.org/10.37236/1244

Abstract

Connected graphs with minimum degree $\delta$ and at least $2\delta + 1$ vertices have paths with at least $2\delta + 1$ vertices. We provide a characterization of all such graphs which have no longer paths.

Published
1996-06-24
How to Cite
Ali, A. A., & Staton, W. (1996). On Extremal Graphs With No Long Paths. The Electronic Journal of Combinatorics, 3(1), R20. https://doi.org/10.37236/1244
Issue
Volume 3, Issue 1 (1996)
Article Number
R20