Generalization of matching extensions in graphs (III)
发布时间：2025-04-30
点击次数：
- 发布时间：
- 2025-04-30
- 论文名称：
- Generalization of matching extensions in graphs (III)
- 发表刊物：
- Discrete Applied Mathmatics
- 摘要：
- Proposed as a general framework, Liu and Yu [6] introduced (n; k; d)-graphs to unify
the concepts of de¯ciency of matchings, n-factor-criticality and k-extendability. Let G
be a graph and let n; k and d be non-negative integers such that n+2k+d+2 6 jV (G)j
and jV (G)j ¡ n ¡ d is even. If deleting any n vertices from G, the remaining subgraph
H of G contains a k-matching and each k-matching can be extended to a defect-d
matching in H, then G is called an (n; k; d)-graph. In this paper, we obtain more
properties of (n; k; d)-graphs, in particular the recursive relations of (n; k; d)-graphs for
distinct parameters n; k and d. Moreover, we provide a characterization for maximal
non-(n; k; d)-graphs.
- 合写作者：
- B. Bai, H.Lu and Q.Yu
- 是否译文：
- 否
- 发表时间：
- 2011-09-03