A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G / H is even and every non-circuit component of H is a subdivision of a Kotzig graph. It was conjectured by Haggkvist and Markstrom (Kotzig Frame Conjecture, JCTB 2006) that if a cubic graph G contains a Kotzig frame, then G has a circuit double cover. This conjecture was verified for some special cases: it is proved by Goddyn if a Kotzig frame has only one component, by Haggkvist and Markstrom (JCTB 2006) if a Kotzig frame has at most one non-circuit component. In this paper, the Kotzig Frame Conjecture is further verified for some families of cubic graphs with Kotzig frames H of the following types: (i) a Kotzig frame H has at most two components; or (ii) the contracted graph G / H is a tree if parallel edges are identified as a single edge. The first result strengthens the theorem by Goddyn. The second result is a further generalization of the first result, and is a partial result to the Kotzig Frame Conjecture for frames with multiple Kotzig components.
[1]
C. Godsil,et al.
Cycles in graphs
,
1985
.
[2]
J. A. Bondy,et al.
Graph Theory with Applications
,
1978
.
[3]
G. Szekeres,et al.
Polyhedral decompositions of cubic graphs
,
1973,
Bulletin of the Australian Mathematical Society.
[4]
Cun-Quan Zhang.
Integer Flows and Cycle Covers of Graphs
,
1997
.
[5]
J. A. Bondy,et al.
Graph Theory
,
2008,
Graduate Texts in Mathematics.
[6]
H. Fleischner.
Eulerian graphs and related topics
,
1990
.
[7]
Melody Chan.
A survey of the cycle double cover conjecture
,
2009
.
[8]
Klas Markström,et al.
Cycle double covers and spanning minors I
,
2006,
J. Comb. Theory, Ser. B.
[9]
D. West.
Introduction to Graph Theory
,
1995
.
[10]
Bill Jackson.
On circuit covers, circuit decompositions and Euler tours of graphs
,
1993
.