Cycle double covers and spanning minors I

Journal of Combinatorial Theory, Series B(2006)

引用 0|浏览1
暂无评分
摘要
Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with even cycles has a cycle double cover, in fact a 6-CDC. We prove this for two other families of graphs similar to Kotzig graphs as well.
更多
查看译文
关键词
Cycle double cover,Kotzig,Frame,Cubic graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要