On Cui-Kano's Characterization Problem on Graph Factors

Details On Cui-Kano's Characterization Problem on Graph Factors On Cui-Kano's Characterization Problem on Graph Factors

2011-09-22

arxiv.org/abs/1109.4863v1

Mathematics

Combinatorics

11 pages

Scientific paper

An $H_n$-factor of a graph $G$ is defined to be a spanning subgraph $F$ of $G$ such that each vertex has degree belonging to the set $\{1,3,5,...,2n-1,2n\}$ in $F$. In this paper, we investigate $H_n$-factors of graphs by using Lov\'asz's structural descriptions to the degree prescribed subgraph problem. We find some sufficient conditions for the existence of an $H_n$-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.

Affiliated with

Also associated with

No associations

Rating

On Cui-Kano's Characterization Problem on Graph Factors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Cui-Kano's Characterization Problem on Graph Factors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Cui-Kano's Characterization Problem on Graph Factors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263437