Counting perfect matchings in the geometric dual (Q2840713): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2011.05.039 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2011.05.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029922317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in planar cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfying states of triangulations of a convex \(n\)-gon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184837 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2011.05.039 / rank
 
Normal rank

Latest revision as of 00:45, 20 December 2024

scientific article
Language Label Description Also known as
English
Counting perfect matchings in the geometric dual
scientific article

    Statements

    Counting perfect matchings in the geometric dual (English)
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    perfect matchings
    0 references
    cubic planar graph
    0 references
    Lovasz-Plummer conjecture
    0 references
    Ising model
    0 references

    Identifiers