On extremal graphs with no long paths

0.00 Avg rating—0 Votes

Article ID:	iaor19962221
Country:	United States
Volume:	3
Start Page Number:	5
End Page Number:	34
Publication Date:	Jul 1996
Journal:	Electronic Journal of Combinatorics
Authors:	Ali Asad Ali

Abstract:

Connected graphs with minimum degree δ at at least 2δ+1 vertices have paths with at least 2δ+1 vertices. The authors provide a characterization of all such graphs which have no longer paths. (Data collected 24/Jul/96).

Reviews

Required fields are marked *. Your email address will not be published.