首页   按字顺浏览 期刊浏览 卷期浏览 Can the Complete Graph with 2n+1 Vertices be Packed with Copies of an Arbitrary Tree ha...
Can the Complete Graph with 2n+1 Vertices be Packed with Copies of an Arbitrary Tree havingnEdges?

 

作者: DukeR. A.,  

 

期刊: The American Mathematical Monthly  (Taylor Available online 1969)
卷期: Volume 76, issue 10  

页码: 1128-1130

 

ISSN:0002-9890

 

年代: 1969

 

DOI:10.1080/00029890.1969.12000431

 

出版商: Taylor&Francis

 

数据来源: Taylor

 

 

点击下载:  PDF (167KB)



返 回