We show that every 2-connected cubic graph G has a cycle double cover if G has a spanning subgraph F such that (i) every component of F has an even number of vertices (ii) every component of F is either a cycle or a subdivision of a Kotzig graph and (iii) the components of F are connected to each other in a certain general manner. (C) 2018 Elsevier Inc. All rights reserved.
机构:
HUN REN Alfred Renyi Inst Math, Budapest, Hungary
Univ Pannonia, Veszprem, HungaryHUN REN Alfred Renyi Inst Math, Budapest, Hungary
Barat, Janos
Grzesik, Andrzej
论文数: 0引用数: 0
h-index: 0
机构:
Jagiellonian Univ, Fac Math & Comp Sci, Krakow, PolandHUN REN Alfred Renyi Inst Math, Budapest, Hungary
Grzesik, Andrzej
Jung, Attila
论文数: 0引用数: 0
h-index: 0
机构:
HUN REN Alfred Renyi Inst Math, Budapest, Hungary
Eotvos Lorand Univ, Budapest, HungaryHUN REN Alfred Renyi Inst Math, Budapest, Hungary
Jung, Attila
Nagy, Zoltan Lorant
论文数: 0引用数: 0
h-index: 0
机构:
Eotvos Lorand Univ, Budapest, Hungary
Eotvos Lorand Univ, ELTE Linear Hypergraphs Res Grp, Budapest, HungaryHUN REN Alfred Renyi Inst Math, Budapest, Hungary
Nagy, Zoltan Lorant
Palvolgyi, Domotor
论文数: 0引用数: 0
h-index: 0
机构:
HUN REN Alfred Renyi Inst Math, Budapest, HungaryHUN REN Alfred Renyi Inst Math, Budapest, Hungary