Enumerating perfect matchings of a Halin graph

DOI10.16360/J.CNKI.JBNUNS.2019.03.002MaRDI QIDQ5209404zbMATH OpenFDO

Authors Haoyang Lv, Xiuping Zhang

Publication date 22 January 2020

Full work available at URL https://doi.org/10.16360/J.CNKI.JBNUNS.2019.03.002

zbMATH Keywords

cubic Halin graphperfect matchingregular glue

Mathematics Subject Classification ID

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

Recommendations

• A new lower bound on the number of perfect matchings in cubic graphs
• An improved linear bound on the number of perfect matchings in cubic graphs
• Cubic bridgeless graphs have more than a linear number of perfect matchings
• Counting perfect matchings in the geometric dual
• The numbers of perfect matching in three types of 3-regular graphs

Cited in

(3)

• Touching perfect matchings and halving lines
• scientific article; zbMATH DE number 2099352 (Why is no real title available?)
• scientific article; zbMATH DE number 5196300 (Why is no real title available?)

This page was built for publication: Enumerating perfect matchings of a Halin graph

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