12 articles in this issue
Adriano Barlotti, Mario Gionfriddo, Giuseppe Tallini
This issue is dedicated to the meeting "Combinatorics 92".
Rafael Artzy
The classical Benz planes, that is, Möbius, Minkowski, and Laguerre planes, can be coordinatized [cf. 1], respectively, by the field C of complex numbers, the ring of “double numbers” z=x+jy (x,y ? R) where an element j not in R, with j2=1 is adjoin... see more
Walter Benz
We determine the group of isometries of certain spherical spaces which are embedded in Galois Spaces. Concerning other results of similar type see [2],[3],[4],[5],[6].
Claude Berge
Let q be a positive integer. Many graphs admit a partial coloring with q colors and a clique partition such that each of the cliques is strongly colored, that is: contains the largest possible number of different colors. If a graph G and all its induced s... see more
Lou Caccetta
In graph theory, the term critical is usually used with respect to specified graph parameter P and applies when the graph G under consideration has the property P but alteration of G (such as vertex deletion, edge deletion or edge addition) result in a g... see more
Paul Erdös
At the meeting in Catania in 1989, I gave a talk entitled “On some of my favourite problems in graph theory and block designs”. I stated twenty problems where important new results have been found.
Katherine Heinrich
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path or a union of paths (a linear forest). We survey known results when the graph and the linear forest are of prescribed types, and when the decomposition sati... see more
Helmut Karzel
See directly the article.
Udo Ott
Chris A. Rodger
Alex Rosa
Joseph A. Thas
Let C be a code of length k over an alphabet A of size q greather or equal 2. Having chosen m with 2? m ? k we impose the following condition on C: no two words agree in as many as m positions. It then follows that |C|? qm. If |C|=qm, then C is called a M... see more