Adjoints and Duals of Matroids Linearly Representable over a Skewfield.
Admissible functions and asymptotics for labelled structures by number of components.
Adomatic and idomatic numbers of graphs
Advanced determinant calculus.
Affine Hjelmslev-Ebenen mit verfeinerten Nachbarschaftsrelationen.
Affine permutations and inversion multigraphs.
Affine permutations of type .
Affine resolvable balanced incomplete block designs: a survey.
Affine resolvable incomplete block designs
Affine transformations of a Leonard pair.
Affine Triple Systems and Matroid Designs.
Affine Weyl groups as infinite permutations.
Airy phenomena and analytic combinatorics of connected graphs.
Ako bol vyriešený problém štyroch farieb
Algebraic and Combinatorial Characterization of Latin squares I
Algebraic and combinatorial properties of products [Abstract of thesis]
Algebraic approach to locally finite trees with one end
Let be an infinite locally finite tree. We say that has exactly one end, if in any two one-way infinite paths have a common rest (infinite subpath). The paper describes the structure of such trees and tries to formalize it by algebraic means, namely by means of acyclic monounary algebras or tree semilattices. In these algebraic structures the homomorpisms and direct products are considered and investigated with the aim of showing, whether they give algebras with the required properties. At...
Algebraic categories whose projectives are explicitly free.
Algebraic combinatorics related to the free Lie algebra.
Algebraic conditions for -tough graphs
We give some algebraic conditions for -tough graphs in terms of the Laplacian eigenvalues and adjacency eigenvalues of graphs.