Characterization of forbidden subgraphs for the existence of even factors in a graph

Liming Xiong

doi:10.1016/j.dam.2017.02.015

Characterization of forbidden subgraphs for the existence of even factors in a graph

Liming Xiong

数学学院

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

14 引用（Scopus）

摘要

In 2008, it is shown that if H≅K_1,3 (the claw), then every H-free graph G has an even factor if and only if δ(G)≥2 and every odd branch-bond of G having an edge-branch. In this paper, we characterize all connected graphs H with order at least three such that every H-free graph has an even factor if and only if δ(G)≥2 and every odd branch-bond of G has an edge-branch.

源语言	英语
页（从-至）	135-139
页数	5
期刊	Discrete Applied Mathematics
卷	223
DOI	https://doi.org/10.1016/j.dam.2017.02.015
出版状态	已出版 - 31 5月 2017

访问文件

10.1016/j.dam.2017.02.015

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{1115b597bc3b496d82ee66acd8effb61,

title = "Characterization of forbidden subgraphs for the existence of even factors in a graph",

abstract = "In 2008, it is shown that if H≅K1,3 (the claw), then every H-free graph G has an even factor if and only if δ(G)≥2 and every odd branch-bond of G having an edge-branch. In this paper, we characterize all connected graphs H with order at least three such that every H-free graph has an even factor if and only if δ(G)≥2 and every odd branch-bond of G has an edge-branch.",

keywords = "Branch-bond, Chair-free, Claw-free, Even factor, Forbidden graph",

author = "Liming Xiong",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2017",

month = may,

day = "31",

doi = "10.1016/j.dam.2017.02.015",

language = "English",

volume = "223",

pages = "135--139",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Characterization of forbidden subgraphs for the existence of even factors in a graph

AU - Xiong, Liming

PY - 2017/5/31

Y1 - 2017/5/31

N2 - In 2008, it is shown that if H≅K1,3 (the claw), then every H-free graph G has an even factor if and only if δ(G)≥2 and every odd branch-bond of G having an edge-branch. In this paper, we characterize all connected graphs H with order at least three such that every H-free graph has an even factor if and only if δ(G)≥2 and every odd branch-bond of G has an edge-branch.

AB - In 2008, it is shown that if H≅K1,3 (the claw), then every H-free graph G has an even factor if and only if δ(G)≥2 and every odd branch-bond of G having an edge-branch. In this paper, we characterize all connected graphs H with order at least three such that every H-free graph has an even factor if and only if δ(G)≥2 and every odd branch-bond of G has an edge-branch.

KW - Branch-bond

KW - Chair-free

KW - Claw-free

KW - Even factor

KW - Forbidden graph

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

U2 - 10.1016/j.dam.2017.02.015

DO - 10.1016/j.dam.2017.02.015

M3 - Article

AN - SCOPUS:85014596904

SN - 0166-218X

VL - 223

SP - 135

EP - 139

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Characterization of forbidden subgraphs for the existence of even factors in a graph

摘要

访问文件

其它文件与链接

指纹

引用此