The 7/5‐conjecture strengthens itself
作者:
A. V. Kostochka,
期刊:
Journal of Graph Theory
(WILEY Available online 1995)
卷期:
Volume 19,
issue 1
页码: 65-67
ISSN:0364-9024
年代: 1995
DOI:10.1002/jgt.3190190107
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThe following is proved: if every bridgeless graphGhas a cycle cover of length at most 7/5|E(G)|, then every bridgeless graphGhas a cycle cover of length at most 7/5|E(G)| such that any edge ofGis covered once or twice. © 1995 John Wiley&Sons, Inc
点击下载:
PDF
(127KB)
返 回