A characterization of self-complementary graphs of order 8
A combinatorial derivation of the number of labeled forests.
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
A complete grammar for decomposing a family of graphs into 3-connected components.
A direct decomposition of 3-connected planar graphs.
A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants.
A Generalization of the Matrix-Tree Theorem.
A generating function for fatgraphs
A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
A new class of enumeration problems
A new spectral method for determining the number of spanning trees.
A non-differentiablity result for the inversion operator between Sobolev spaces.
A note on intersection dimensions of graph classes
The intersection dimension of a graph with respect to a class of graphs is the minimum such that is the intersection of some graphs on the vertex set belonging to . In this paper we follow [ Kratochv’ıl J., Tuza Z.: Intersection dimensions of graph classes, Graphs and Combinatorics 10 (1994), 159–168 ] and show that for some pairs of graph classes , the intersection dimension of graphs from with respect to is unbounded.
A note on major sequences and external activity in trees.
A note on the distribution of the three types of nodes in uniform binary trees.
A note on the total number of double Eulerian circuits in multigraphs.
A partition of connected graphs.
A partition of the Catalan numbers and enumeration of genealogical trees
A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the form a partition of the n-th Catalan numer Cₙ, that means .
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs.
Acyclic digraphs and eigenvalues of -matrices.