On the upper bounds of the numbers of perfect matchings in graphs with given parameters
From MaRDI portal
Publication:871682
DOI10.1007/S10255-006-0360-1zbMATH Open1111.05050OpenAlexW2017040432MaRDI QIDQ871682FDOQ871682
Publication date: 20 March 2007
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-006-0360-1
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (8)
- The matching energy of graphs with given parameters
- On lower bounds of number of perfect matchings in fullerene graphs
- Tight lower bounds on the matching number in a graph with given maximum degree
- On counting perfect matchings in general graphs
- Maximum number of colorings of (2k, k2)βgraphs
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
- Limit Shape of Perfect Matchings on Contracting Bipartite Graphs
Recommendations
- Upper bounds for perfect matchings in Pfaffian and planar graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On counting perfect matchings in general graphs π π
- Extremal Graphs With a Given Number of Perfect Matchings π π
- On the number of perfect matchings for some certain types of bipartite graphs π π
- On the number of perfect matchings in a bipartite graph π π
- Counting perfect matchings in \(n\)-extendable graphs π π
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges π π
- The maximum number of perfect matchings in graphs with a given degree sequence π π
This page was built for publication: On the upper bounds of the numbers of perfect matchings in graphs with given parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871682)