The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 12F10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6626045 / rank
 
Normal rank
Property / zbMATH Keywords
 
Tutte polynomial
Property / zbMATH Keywords: Tutte polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
medial graphs
Property / zbMATH Keywords: medial graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
Eulerian partitions
Property / zbMATH Keywords: Eulerian partitions / rank
 
Normal rank
Property / zbMATH Keywords
 
Puiseux series
Property / zbMATH Keywords: Puiseux series / rank
 
Normal rank

Revision as of 00:27, 28 June 2023

scientific article
Language Label Description Also known as
English
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
scientific article

    Statements

    The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2016
    0 references
    Tutte polynomial
    0 references
    medial graphs
    0 references
    Eulerian partitions
    0 references
    Puiseux series
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references