Subdivisions of graphs with large minimum degree
作者:
Carsten Thomassen,
期刊:
Journal of Graph Theory
(WILEY Available online 1984)
卷期:
Volume 8,
issue 1
页码: 23-28
ISSN:0364-9024
年代: 1984
DOI:10.1002/jgt.3190080103
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractWe prove a theorem on path systems implying the conjecture of Bollobás that there exists a functionf(k, m)(wherekandmare natural numbers) satisfying the following: For each graphGof minimum degree at leastf(k, m)there exists a graphHof minimum degree at leastksuch thatGcontains the graph obtained fromHby subdividing each edgemtimes
点击下载:
PDF
(256KB)
返 回