Graph-based counting theory and its applications

DOI10.6043/J.ISSN.0438-0479.202010039MaRDI QIDQ4996510zbMATH OpenFDO

Authors Xianan Jin, Jianguo Qian, Weiling Yang

Publication date 1 July 2021

Full work available at URL https://doi.org/10.6043/J.ISSN.0438-0479.202010039

zbMATH Keywords

combinatorial enumerationcombinatorial knot theorygraph enumerationmatching enumeration

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Applications of graph theory (05C90) Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• The analytic formula of the number of perfect matchings of two types of graphs
• Advanced graph theory and combinatorics
• The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs
• The number of perfect matchings in four types of particular graphs
• scientific article; zbMATH DE number 7266769

Cited in

(3)

• Counting representable sets on simple graphs
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• scientific article; zbMATH DE number 1156638 (Why is no real title available?)

This page was built for publication: Graph-based counting theory and its applications

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