Sciweavers

9 search results - page 1 / 2
» Enumerative combinatorics
Sort
View
SIGACT
2008
67views more  SIGACT 2008»
13 years 4 months ago
Enumerative combinatorics
Charalambos A. Charalambides
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
13 years 4 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
13 years 4 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
Pierre Leroux
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
13 years 4 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...