On Cui-Kano's characterization problem on graph factors

Hongliang Lu, David G.L. Wang

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)335-343
Number of pages9
JournalJournal of Graph Theory
Volume74
Issue number3
DOIs
Publication statusPublished - Nov 2013
Externally publishedYes

Keywords

  • Lovász's structural description

Fingerprint

Dive into the research topics of 'On Cui-Kano's characterization problem on graph factors'. Together they form a unique fingerprint.

Cite this