Cycle double covers via Kotzig graphs.

Herbert Fleischner,Roland Häggkvist,Arthur Hoffmann-Ostenhof

Journal of Combinatorial Theory, Series B（2019）

引用 0|浏览6

暂无评分

摘要

We show that every 2-connected cubic graph G has a cycle double cover if G has a spanning subgraph F such that (i) every component of F has an even number of vertices (ii) every component of F is either a cycle or a subdivision of a Kotzig graph and (iii) the components of F are connected to each other in a certain general manner.

查看译文

关键词

Cubic graph,3-regular graph,Cycle double cover,Frame,Kotzig graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要