首页   按字顺浏览 期刊浏览 卷期浏览 On the maximum number of pairwise compatible euler cycles
On the maximum number of pairwise compatible euler cycles

 

作者: H. Fleischner,   A. J. W. Hilton,   Bill Jackson,  

 

期刊: Journal of Graph Theory  （WILEY Available online 1990）
卷期: Volume 14, issue 1  

页码: 51-63

 

ISSN:0364-9024

 

年代: 1990

 

DOI:10.1002/jgt.3190140106

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractB. Jackson [4] made the following conjecture: IfGis an Eulerian graph with δ(G) ≥ 2k, thenGhas a set of 2k‐ 2 pairwise compatible Euler cycles (i.e., every pair of adjacent edges appears in at most one of these Euler cycles as a pair of consecutive edges). We verify this conjecture in the case where every circuit ofGis a block

 

点击下载:  PDF (628KB)



返 回