An exact upper bound to the maximum number of perfect matchings in cubic pseudographs
From MaRDI portal
Publication:1164639
DOI10.1007/BF02576436zbMath0486.05039MaRDI QIDQ1164639
Publication date: 1981
Published in: Calcolo (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
This page was built for publication: An exact upper bound to the maximum number of perfect matchings in cubic pseudographs
