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

From MaRDI portal

Revision as of 04:44, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1164639

Jump to:navigation, search

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

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Connected cubic graphs with the maximum number of perfect matchings

Cites Work

This page was built for publication: An exact upper bound to the maximum number of perfect matchings in cubic pseudographs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1164639&oldid=13226475"