Enumeration of hamiltonian paths in Caley diagrams.
Enumeration of perfect matchings of a type of quadratic lattice on the torus.
Enumeration problems of trees. (Abzählprobleme bei Bäumen.)
Enumeration under group action
Enumerative formulae for unrooted planar maps: a pattern.
Enumerative problems inspired by Mayer's theory of cluster integrals.
Equivalence classes of functions on finite sets.
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees
Let be the least number for which there exists a simple graph with vertices having precisely spanning trees. Similarly, define as the least number for which there exists a simple graph with edges having precisely spanning trees. As an -cycle has exactly spanning trees, it follows that . In this paper, we show that and if and only if , which is a subset of Euler’s idoneal numbers. Moreover, if and we show that and This improves some previously estabilished bounds.
Expanding stars
Explicit enumeration of triangulations with multiple boundaries.
Faster backtracking algorithms for the generation of symmetry-invariant permutations.
Flexibility of embeddings of bouquets of circles on the projective plane and Klein bottle.
Graph compositions. I: Basic enumeration.
Graph weights arising from Mayer's theory of cluster integrals.
Graphs and associative triples in quasitrivial groupoids
Graphs and quasitrivial groupoids
Groupoids with non-associative triples on the diagonal
Hamiltonian paths on Platonic graphs.
How frequently is a system of 2-linear Boolean equations solvable?