Header menu link for other important links
X
Degree conditions for forests in graphs
, A.A. Diwan
Published in
2005
Volume: 301
   
Issue: 2-3
Pages: 228 - 231
Abstract
If H is any forest of order n with m edges, then any graph G of order ≥n with d(u)+d(v)≥2m-1 for any two non-adjacent vertices u,v contains H. © 2005 Elsevier B.V. All rights reserved.
About the journal
JournalDiscrete Mathematics
ISSN0012365X