An exact upper bound to the maximum number of perfect matchings in cubic pseudographs

DOI10.1007/BF02576436zbMath0486.05039MaRDI QIDQ1164639

Giulia Galbiati

Publication date: 1981

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

perfect matching; pseudograph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

Cites Work

• Unnamed Item
• Unnamed Item