Cycle Double Covers and Semi-Kotzig Frame
Abstract
Let H be a cubic graph admitting a 3-edge-coloring c: E(H) Z3 such that the edges colored by 0 and μ∈\1,2\ induce a Hamilton circuit of H and the edges colored by 1 and 2 induce a 2-factor F. The graph H is semi-Kotzig if switching colors of edges in any even subgraph of F yields a new 3-edge-coloring of H having the same property as c. A spanning subgraph H of a cubic graph G is called a semi-Kotzig frame if the contracted graph G/H is even and every non-circuit component of H is a subdivision of a semi-Kotzig graph. In this paper, we show that a cubic graph G has a circuit double cover if it has a semi-Kotzig frame with at most one non-circuit component. Our result generalizes some results of Goddyn (1988), and H\"aggkvist and Markstr\"om [J. Combin. Theory Ser. B (2006)].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.