Generalized matching extension problem in regular bipartite graphs

DOI10.1016/J.DISC.2026.115182MaRDI QIDQ7285273zbMATH OpenFDO

Authors Jun Fujisawa, Shohei Koizumi, Yusuke Suzuki

Publication date 19 June 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115182

Mathematics Subject Classification ID

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

Cites work

• Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane
• Edge proximity conditions for extendability in regular bipartite graphs
• Extending matchings in graphs: A survey
• scientific article; zbMATH DE number 19207 (Why is no real title available?)
• scientific article; zbMATH DE number 1161241 (Why is no real title available?)
• Lower bound of cyclic edge connectivity for n-extendability of regular graphs
• Matching Extendability in Hypercubes
• Matching extension missing vertices and edges in triangulations of surfaces
• Max-cut and extendability of matchings in distance-regular graphs
• Proximity thresholds for matching extension in planar and projective planar triangulations
• Removal of subgraphs and perfect matchings in graphs on surfaces
• Toughness, binding number and restricted matching extension in a graph

This page was built for publication: Generalized matching extension problem in regular bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285273)