Connected graphs without long paths Original Research Article
Author/Authors :
P.N. Balister، نويسنده , , E. Gy?ri، نويسنده , , J. Lehel، نويسنده , , R.H. Schelp، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
8
From page :
4487
To page :
4494
Abstract :
We determine the maximum number of edges in a connected graph with n vertices if it contains no path with image vertices. We also determine the extremal graphs.
