Signed Cycle Double Covers

Electronic Journal Of Combinatorics

Lingsheng Shi¹ 

关键词: Cycle cover;    Even graph;    Flow;    Signed graph;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together cover every edge of the graph exactly twice. A signed graph is a graph with each edge assigned by a positive or a negative sign. In this article

【 授权许可】

Others