工程数学学报
工程數學學報
공정수학학보
CHINESE JOURNAL OF ENGINEERING MATHEMATICS
2004年
6期
910-914
,共5页
二分图%圈%大圈%2-因子
二分圖%圈%大圈%2-因子
이분도%권%대권%2-인자
bipartite graphs%cycles%large cycles%2-factors
本文给出了均衡二分图有一个2-因子恰含κ个大圈的度条件.设G=(V1,V2,E)是一个二分图,满足|V1|=|V2|=n ≥ sκ,其中s≥3和κ≥1是两个整数.如果图G的最小度至少为[(1-1/s)n]+1,那么G有一个2-因子恰含κ个圈使得每个圈长至少为2s.
本文給齣瞭均衡二分圖有一箇2-因子恰含κ箇大圈的度條件.設G=(V1,V2,E)是一箇二分圖,滿足|V1|=|V2|=n ≥ sκ,其中s≥3和κ≥1是兩箇整數.如果圖G的最小度至少為[(1-1/s)n]+1,那麽G有一箇2-因子恰含κ箇圈使得每箇圈長至少為2s.
본문급출료균형이분도유일개2-인자흡함κ개대권적도조건.설G=(V1,V2,E)시일개이분도,만족|V1|=|V2|=n ≥ sκ,기중s≥3화κ≥1시량개정수.여과도G적최소도지소위[(1-1/s)n]+1,나요G유일개2-인자흡함κ개권사득매개권장지소위2s.
In this paper, we investigate the degrees condition which implies that a balanced bipartite graph has a 2-factor with exactly κ vertex-disjoint large cycles. Let G = (V1, V2; E) be a bipartite graph with |V1| = |V2| = n ≥ sκ, where s ≥ 3 and κ≥ 1 are two integers. If the minimum degree of G is at least [(1 - 1/s)n] + 1, then G has a 2-factor with exactly κ cycles of length at least 2s.
