Binding number conditions for matching extension

DOI10.1016/S0012-365X(01)00192-3zbMath0990.05102OpenAlexW2054195094MaRDI QIDQ1598823

Andrew M. Robertshaw, Douglas R. Woodall

Publication date: 28 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00192-3

zbMATH Keywords

1-factorperfect matchingmatching extensionbinding numberextendable matching

Mathematics Subject Classification ID

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

Related Items (5)

Path factors in subgraphs ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Binding number and path-factor critical deleted graphs ⋮ Best monotone degree conditions for binding number ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs

This page was built for publication: Binding number conditions for matching extension