On Extremal Graphs With No Long Paths

  • Asad Ali Ali
  • William Staton

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
Article Number
R20