报告题目：Cycle Double Cover of Graphs I: Circuit Extension and Long Cycles

报告人：Dr. Dong Ye （Middle Tennessee State University）

报告时间：6月1日 16：00-17：00

报告地点：管理科研楼1518

摘要：Circuit Double Cover Conjecture says that every cubic bridgeless graph has a family of circuits that covers every edge twice. A circuit $C$ of a cubic graph $G$ is a connected 2-regular subgraph. An extension of $C$ is a circuit $D$ such that $V(C)/subseteqV(D)$ and $E(C)/ne E(D)$. It was proved that if every circuit is extendable for every bridgeless cubic graph, then the circuit double cover conjecture is true (Kahn, Robertson, Seymour 1987). However, graphs with non-extendable circuits have been discovered by Fleischner (1994) and Kochol (2001). In this talk, I will talk a variation of circuit extension approach to Circuit Double Cover Conjecture, and some recent results about circuit extension.