On the 2-factor index of a graph

Liming Xiong; Ming Chu Li

doi:10.1016/j.disc.2006.11.012

On the 2-factor index of a graph

Liming Xiong^*, Ming Chu Li

^*此作品的通讯作者

数学学院

Dalian University of Technology

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

8 引用（Scopus）

摘要

The 2-factor index of a graph G, denoted by f (G), is the smallest integer m such that the m-iterated line graph L^m (G) of G contains a 2-factor. In this paper, we provide a formula for f (G), and point out that there is a polynomial time algorithm to determine f (G).

源语言	英语
页（从-至）	2478-2483
页数	6
期刊	Discrete Mathematics
卷	307
期	21
DOI	https://doi.org/10.1016/j.disc.2006.11.012
出版状态	已出版 - 6 10月 2007

访问文件

10.1016/j.disc.2006.11.012

其它文件与链接

链接到 Scopus 的出版物

引用此

Xiong, L., & Li, M. C. (2007). On the 2-factor index of a graph. Discrete Mathematics, 307(21), 2478-2483. https://doi.org/10.1016/j.disc.2006.11.012

@article{afe50d6a4e2c4690b169a36d0990e786,

title = "On the 2-factor index of a graph",

abstract = "The 2-factor index of a graph G, denoted by f (G), is the smallest integer m such that the m-iterated line graph Lm (G) of G contains a 2-factor. In this paper, we provide a formula for f (G), and point out that there is a polynomial time algorithm to determine f (G).",

keywords = "2-factor, 2-factor index, Branch-bond, Iterated line graph",

author = "Liming Xiong and Li, {Ming Chu}",

year = "2007",

month = oct,

day = "6",

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

language = "English",

volume = "307",

pages = "2478--2483",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "21",

}

TY - JOUR

T1 - On the 2-factor index of a graph

AU - Xiong, Liming

AU - Li, Ming Chu

PY - 2007/10/6

Y1 - 2007/10/6

N2 - The 2-factor index of a graph G, denoted by f (G), is the smallest integer m such that the m-iterated line graph Lm (G) of G contains a 2-factor. In this paper, we provide a formula for f (G), and point out that there is a polynomial time algorithm to determine f (G).

AB - The 2-factor index of a graph G, denoted by f (G), is the smallest integer m such that the m-iterated line graph Lm (G) of G contains a 2-factor. In this paper, we provide a formula for f (G), and point out that there is a polynomial time algorithm to determine f (G).

KW - 2-factor

KW - 2-factor index

KW - Branch-bond

KW - Iterated line graph

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

U2 - 10.1016/j.disc.2006.11.012

DO - 10.1016/j.disc.2006.11.012

M3 - Article

AN - SCOPUS:34648828468

SN - 0012-365X

VL - 307

SP - 2478

EP - 2483

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 21

ER -

On the 2-factor index of a graph

摘要

访问文件

其它文件与链接

指纹

引用此