Latin squares of order 10.
Counting unlabelled topologies and transitive relations.
Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums.
Short cycles in random regular graphs.
Acyclic digraphs and eigenvalues of -matrices.
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are known as octahedrites, can all be obtained from an elementary family of starting graphs by repeatedly applying two expansion operations. This allows for construction of a linear time generator of all graphs in the class with at most a given order, up to isomorphism.
Page 1