The existence of even factors in iterated line graphs

Liming Xiong

doi:10.1016/j.disc.2007.10.043

The existence of even factors in iterated line graphs

Liming Xiong^*

^*此作品的通讯作者

数学学院

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

7 引用（Scopus）

摘要

An even factor of a graph is a spanning subgraph of G in which all degrees are even, positive integers. In this paper, we characterize the claw-free graphs having even factors and then prove that the n-iterated line graph Lⁿ (G) of G has an even factor if and only if every end branch of G has length at most n and every odd branch-bond of G has a branch of length at most n + 1.

源语言	英语
页（从-至）	5891-5894
页数	4
期刊	Discrete Mathematics
卷	308
期	23
DOI	https://doi.org/10.1016/j.disc.2007.10.043
出版状态	已出版 - 6 12月 2008

访问文件

10.1016/j.disc.2007.10.043

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{567861ed8a004db4958be3f819c7f0ff,

title = "The existence of even factors in iterated line graphs",

abstract = "An even factor of a graph is a spanning subgraph of G in which all degrees are even, positive integers. In this paper, we characterize the claw-free graphs having even factors and then prove that the n-iterated line graph Ln (G) of G has an even factor if and only if every end branch of G has length at most n and every odd branch-bond of G has a branch of length at most n + 1.",

keywords = "Branch-bond, Claw-free graph, Even factor, Iterated line graph",

author = "Liming Xiong",

year = "2008",

month = dec,

day = "6",

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

language = "English",

volume = "308",

pages = "5891--5894",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "23",

}

TY - JOUR

T1 - The existence of even factors in iterated line graphs

AU - Xiong, Liming

PY - 2008/12/6

Y1 - 2008/12/6

N2 - An even factor of a graph is a spanning subgraph of G in which all degrees are even, positive integers. In this paper, we characterize the claw-free graphs having even factors and then prove that the n-iterated line graph Ln (G) of G has an even factor if and only if every end branch of G has length at most n and every odd branch-bond of G has a branch of length at most n + 1.

AB - An even factor of a graph is a spanning subgraph of G in which all degrees are even, positive integers. In this paper, we characterize the claw-free graphs having even factors and then prove that the n-iterated line graph Ln (G) of G has an even factor if and only if every end branch of G has length at most n and every odd branch-bond of G has a branch of length at most n + 1.

KW - Branch-bond

KW - Claw-free graph

KW - Even factor

KW - Iterated line graph

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

U2 - 10.1016/j.disc.2007.10.043

DO - 10.1016/j.disc.2007.10.043

M3 - Article

AN - SCOPUS:53049091562

SN - 0012-365X

VL - 308

SP - 5891

EP - 5894

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 23

ER -

The existence of even factors in iterated line graphs

摘要

访问文件

其它文件与链接

指纹

引用此