Star subdivisions and connected even factors in the square of a graph

Jan Ekstein; Pemysl Holub; Tomáš Kaiser; Liming Xiong; Shenggui Zhang

doi:10.1016/j.disc.2011.09.004

Star subdivisions and connected even factors in the square of a graph

Jan Ekstein
, Pemysl Holub^*
, Tomáš Kaiser
, Liming Xiong
, Shenggui Zhang

^*此作品的通讯作者

数学学院

University of West Bohemia
Charles University
Jiangxi Normal University
Qinghai University
Northwestern Polytechnical University Xian

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

10 引用（Scopus）

摘要

For any positive integer s, a [2,2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K_1,2s+1) in a graph G has at least three edges in a block of degree at most 2, then ^G2 has a [2,2s]-factor. This extends the results of Hendry and Vogler [5] and Abderrezzak et al. (1991) [1].

源语言	英语
页（从-至）	2574-2578
页数	5
期刊	Discrete Mathematics
卷	312
期	17
DOI	https://doi.org/10.1016/j.disc.2011.09.004
出版状态	已出版 - 6 9月 2012

访问文件

10.1016/j.disc.2011.09.004

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{2f40817de46240c99ae7954b2d48df88,

title = "Star subdivisions and connected even factors in the square of a graph",

abstract = "For any positive integer s, a [2,2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least three edges in a block of degree at most 2, then G2 has a [2,2s]-factor. This extends the results of Hendry and Vogler [5] and Abderrezzak et al. (1991) [1].",

keywords = "Connected even factor, Square of a graph",

author = "Jan Ekstein and Pemysl Holub and Tom{\'a}{\v s} Kaiser and Liming Xiong and Shenggui Zhang",

year = "2012",

month = sep,

day = "6",

doi = "10.1016/j.disc.2011.09.004",

language = "English",

volume = "312",

pages = "2574--2578",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "17",

}

TY - JOUR

T1 - Star subdivisions and connected even factors in the square of a graph

AU - Ekstein, Jan

AU - Holub, Pemysl

AU - Kaiser, Tomáš

AU - Xiong, Liming

AU - Zhang, Shenggui

PY - 2012/9/6

Y1 - 2012/9/6

N2 - For any positive integer s, a [2,2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least three edges in a block of degree at most 2, then G2 has a [2,2s]-factor. This extends the results of Hendry and Vogler [5] and Abderrezzak et al. (1991) [1].

AB - For any positive integer s, a [2,2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least three edges in a block of degree at most 2, then G2 has a [2,2s]-factor. This extends the results of Hendry and Vogler [5] and Abderrezzak et al. (1991) [1].

KW - Connected even factor

KW - Square of a graph

UR - https://www.scopus.com/pages/publications/84862661331

U2 - 10.1016/j.disc.2011.09.004

DO - 10.1016/j.disc.2011.09.004

M3 - Article

AN - SCOPUS:84862661331

SN - 0012-365X

VL - 312

SP - 2574

EP - 2578

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 17

ER -

Star subdivisions and connected even factors in the square of a graph

摘要

访问文件

其它文件与链接

学术指纹

引用此