Generalization of matching extensions in graphs. II.
From MaRDI portal
Publication:2370426
DOI10.1016/j.dam.2006.10.015zbMath1119.05090arXivmath/0609756MaRDI QIDQ2370426
Huifang Yan, Qinglin Yu, Ze-min Jin
Publication date: 26 June 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0609756
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Algorithms for (0, 1,d)-graphs withdconstrains, Generalization of matching extensions in graphs. IV: Closures, Generalization of matching extensions in graphs. III, Minimal graphs for matching extensions
Cites Work