Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
From MaRDI portal
Publication:1598818
DOI10.1016/S0012-365X(01)00189-3zbMath0994.05123MaRDI QIDQ1598818
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
Related Items