Bipartite matching extendable graphs

DOI10.1016/j.disc.2007.09.053zbMath1214.05137OpenAlexW2094363475MaRDI QIDQ998414

Xiumei Wang, Zhen-Kun Zhang, Yanpei Liu

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.053

zbMATH Keywords

matchinggraph theorybipartite matchingbipartite-matching extendable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On n-extendable graphs
• Induced matchings
• On the structure of minimally \(n\)-extendable bipartite graphs
• Perfect matchings and ears in elementary bipartite graphs
• Plane elementary bipartite graphs
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Maximal IM-unextendable graphs

This page was built for publication: Bipartite matching extendable graphs