Perfect matchings and ears in elementary bipartite graphs

DOI10.1016/S0012-365X(96)00291-9zbMath0886.05096OpenAlexW2064247277MaRDI QIDQ1377683

Pierre Hansen, Fu Ji Zhang, Mao Lin Zheng

Publication date: 26 January 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00291-9

zbMATH Keywords

decompositionbipartite graphperfect matchingschemical graphsears

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Bipartite matching extendable graphs

Cites Work

• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching theory -- a sampler: From Dénes König to the present
• Reducible chains in several types of 2-connected graphs
• On minimal elementary bipartite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect matchings and ears in elementary bipartite graphs