On Cui-Kano's characterization problem on graph factors

Hongliang Lu; David G.L. Wang

doi:10.1002/jgt.21712

On Cui-Kano's characterization problem on graph factors

Hongliang Lu, David G.L. Wang

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

An Hn-factor of a graph G is defined to be a spanning subgraph F of G such that each vertex has a degree belonging to the set {1,3,5,.,2n-1,2n} in F, where n≥2. In this article, we investigate Hn-factors of graphs by using Lovász's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an Hn-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988.

Original language	English
Pages (from-to)	335-343
Number of pages	9
Journal	Journal of Graph Theory
Volume	74
Issue number	3
DOIs	https://doi.org/10.1002/jgt.21712
Publication status	Published - Nov 2013
Externally published	Yes

Keywords

Lovász's structural description

Access to Document

10.1002/jgt.21712

Cite this

@article{3f89138f4c934391bca77a86f43e06a2,

title = "On Cui-Kano's characterization problem on graph factors",

abstract = "An Hn-factor of a graph G is defined to be a spanning subgraph F of G such that each vertex has a degree belonging to the set {1,3,5,.,2n-1,2n} in F, where n≥2. In this article, we investigate Hn-factors of graphs by using Lov{\'a}sz's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an Hn-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988.",

keywords = "Lov{\'a}sz's structural description",

author = "Hongliang Lu and Wang, {David G.L.}",

year = "2013",

month = nov,

doi = "10.1002/jgt.21712",

language = "English",

volume = "74",

pages = "335--343",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - On Cui-Kano's characterization problem on graph factors

AU - Lu, Hongliang

AU - Wang, David G.L.

PY - 2013/11

Y1 - 2013/11

N2 - An Hn-factor of a graph G is defined to be a spanning subgraph F of G such that each vertex has a degree belonging to the set {1,3,5,.,2n-1,2n} in F, where n≥2. In this article, we investigate Hn-factors of graphs by using Lovász's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an Hn-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988.

AB - An Hn-factor of a graph G is defined to be a spanning subgraph F of G such that each vertex has a degree belonging to the set {1,3,5,.,2n-1,2n} in F, where n≥2. In this article, we investigate Hn-factors of graphs by using Lovász's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an Hn-factor of a graph. In particular, we make progress on the characterization problem for a special family of graphs proposed by Cui and Kano in 1988.

KW - Lovász's structural description

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

U2 - 10.1002/jgt.21712

DO - 10.1002/jgt.21712

M3 - Article

AN - SCOPUS:84883560058

SN - 0364-9024

VL - 74

SP - 335

EP - 343

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 3

ER -

On Cui-Kano's characterization problem on graph factors

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this