English

Cycle Double Covers and Semi-Kotzig Frame

Combinatorics 2018-03-09 v1

Abstract

Let HH be a cubic graph admitting a 3-edge-coloring c:E(H)Z3c: E(H)\to \mathbb Z_3 such that the edges colored by 0 and μ{1,2}\mu\in\{1,2\} induce a Hamilton circuit of HH and the edges colored by 1 and 2 induce a 2-factor FF. The graph HH is semi-Kotzig if switching colors of edges in any even subgraph of FF yields a new 3-edge-coloring of HH having the same property as cc. A spanning subgraph HH of a cubic graph GG is called a {\em semi-Kotzig frame} if the contracted graph G/HG/H is even and every non-circuit component of HH is a subdivision of a semi-Kotzig graph. In this paper, we show that a cubic graph GG 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\"{a}ggkvist and Markstr\"{o}m [J. Combin. Theory Ser. B (2006)].

Keywords

Cite

@article{arxiv.1105.5190,
  title  = {Cycle Double Covers and Semi-Kotzig Frame},
  author = {Dong Ye and Cun-Quan Zhang},
  journal= {arXiv preprint arXiv:1105.5190},
  year   = {2018}
}
R2 v1 2026-06-21T18:12:51.201Z