Generalization of matching extensions in graphs (III)

Authors:
Bing Bai;Hongliang Lu;Qinglin Yu
Affiliations:
Center for Combinatorics, LPMC, Nankai University, Tianjin, PR China;Department of Mathematics, Xian Jiaotong University, Xian, PR China;Department of Mathematics and Statistics, Thompson Rivers University, Kamloops, BC, Canada and School of Mathematics, Shandong University, Jinan, Shandong, PR China
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 3
Cited 0

Generalization of matching extensions in graphs

Discrete Mathematics - Special issue on the 17th british combinatorial conference selected papers
Graph Theory With Applications

Graph Theory With Applications
Generalization of matching extensions in graphs (II)

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Proposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to unify the concepts of deficiency 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=