Cycle double covers and non-separating cycles

Arthur Hoffmann-Ostenhof; Cun Quan Zhang; Zhang Zhang

doi:10.1016/j.ejc.2019.06.006

Cycle double covers and non-separating cycles

Arthur Hoffmann-Ostenhof, Cun Quan Zhang, Zhang Zhang

科研成果: 期刊稿件 › 文章 › 同行评审

4 引用（Scopus）

摘要

Which 2-regular subgraph R of a cubic graph G can be extended to a cycle double cover of G? We provide a condition which ensures that every R satisfying this condition is part of a cycle double cover of G. As one consequence, we prove that every 2-connected cubic graph which has a decomposition into a spanning tree and a 2-regular subgraph C consisting of k circuits with k≤3, has a cycle double cover containing C.

源语言	英语
页（从-至）	276-284
页数	9
期刊	European Journal of Combinatorics
卷	81
DOI	https://doi.org/10.1016/j.ejc.2019.06.006
出版状态	已出版 - 10月 2019
已对外发布	是

访问文件

10.1016/j.ejc.2019.06.006

其它文件与链接

链接到 Scopus 的出版物

引用此

Hoffmann-Ostenhof, A., Zhang, C. Q., & Zhang, Z. (2019). Cycle double covers and non-separating cycles. European Journal of Combinatorics, 81, 276-284. https://doi.org/10.1016/j.ejc.2019.06.006

@article{b11e09954e4948c5b444549b61293509,

title = "Cycle double covers and non-separating cycles",

abstract = "Which 2-regular subgraph R of a cubic graph G can be extended to a cycle double cover of G? We provide a condition which ensures that every R satisfying this condition is part of a cycle double cover of G. As one consequence, we prove that every 2-connected cubic graph which has a decomposition into a spanning tree and a 2-regular subgraph C consisting of k circuits with k≤3, has a cycle double cover containing C.",

author = "Arthur Hoffmann-Ostenhof and Zhang, {Cun Quan} and Zhang Zhang",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Ltd",

year = "2019",

month = oct,

doi = "10.1016/j.ejc.2019.06.006",

language = "English",

volume = "81",

pages = "276--284",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

}

TY - JOUR

T1 - Cycle double covers and non-separating cycles

AU - Hoffmann-Ostenhof, Arthur

AU - Zhang, Cun Quan

AU - Zhang, Zhang

PY - 2019/10

Y1 - 2019/10

N2 - Which 2-regular subgraph R of a cubic graph G can be extended to a cycle double cover of G? We provide a condition which ensures that every R satisfying this condition is part of a cycle double cover of G. As one consequence, we prove that every 2-connected cubic graph which has a decomposition into a spanning tree and a 2-regular subgraph C consisting of k circuits with k≤3, has a cycle double cover containing C.

AB - Which 2-regular subgraph R of a cubic graph G can be extended to a cycle double cover of G? We provide a condition which ensures that every R satisfying this condition is part of a cycle double cover of G. As one consequence, we prove that every 2-connected cubic graph which has a decomposition into a spanning tree and a 2-regular subgraph C consisting of k circuits with k≤3, has a cycle double cover containing C.

UR - http://www.scopus.com/inward/record.url?scp=85067656104&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2019.06.006

DO - 10.1016/j.ejc.2019.06.006

M3 - Article

AN - SCOPUS:85067656104

SN - 0195-6698

VL - 81

SP - 276

EP - 284

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

Cycle double covers and non-separating cycles

摘要

访问文件

其它文件与链接

指纹

引用此