Displaying similar documents to “О решеточной сложности квазимногообразий графов и эндографов.”

Graph automorphisms of semimodular lattices

Ján Jakubík (2000)

Mathematica Bohemica

Similarity:

This paper deals with the relations between graph automorphisms and direct factors of a semimodular lattice of locally finite length.

On centrally symmetric graphs

Manfred Stern (1996)

Mathematica Bohemica

Similarity:

In this note we extend results on the covering graphs of modular lattices (Zelinka) and semimodular lattices (Gedeonova, Duffus and Rival) to the covering graph of certain graded lattices.