Smallest close to regular bipartite graphs without an almost perfect matching

From MaRDI portal
Publication:606288

DOI10.1007/S10114-010-9124-1zbMATH Open1216.05119OpenAlexW2075182507MaRDI QIDQ606288FDOQ606288


Authors: Lutz Volkmann, Axel Zingsem Edit this on Wikidata


Publication date: 17 November 2010

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-010-9124-1




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Smallest close to regular bipartite graphs without an almost perfect matching

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