On the largest tree of given maximum degree in a connected graph

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3327

Full metadata record

DC Field	Value	Language
dc.contributor.author	Caro, Y	-
dc.contributor.author	Krasikov, I	-
dc.contributor.author	Roditty, Y	-
dc.coverage.spatial	7	en
dc.date.accessioned	2009-05-22T10:41:12Z	-
dc.date.available	2009-05-22T10:41:12Z	-
dc.date.issued	1991	-
dc.identifier.citation	Journal of Graph Theory. 15(1): 7-13	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3327	-
dc.description.abstract	We prove that every connected graph G contains a tree T of maximum degree at most k that either spans G or has order at least k(G) + 1, where (G) is the minimum degree of G. This generalizes and unifies earlier results of Bermond [1] and Win [7]. We also show that the square of a connected graph contains a spanning tree of maximum degree at most three.	en
dc.format.extent	197 bytes	-
dc.format.mimetype	text/plain	-
dc.language.iso	en	-
dc.publisher	Wiley	en
dc.title	On the largest tree of given maximum degree in a connected graph	en
dc.type	Research Paper	en
dc.identifier.doi	http://dx.doi.org/10.1002/jgt.319015010	-
Appears in Collections:	Dept of Mathematics Research Papers Mathematical Sciences

Files in This Item:

File	Description	Size	Format
Article_info.txt		197 B	Text	View/Open