Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Graph isomorphic discrete partially ordered sets and semimodularity

In: Mathematica Slovaca, vol. 60, no. 2
Mária Csontóová - Judita Lihová

Details:

Year, pages: 2010, 157 - 170
Keywords:
discrete partially ordered set, multilattice, graph isomorphism, semimodularity
About article:
In [RATANAPRASERT, C.—DAVEY, B.: \textit{Semimodular lattices with isomorphic graphs}, Order \textbf{4} (1987), 1–13], the authors found conditions under which an isomorphism of graphs of discrete lattices transfers semimodularity. The main theorem of the present paper generalizes their result for discrete partially ordered sets.
How to cite:
ISO 690:
Csontóová, M., Lihová, J. 2010. Graph isomorphic discrete partially ordered sets and semimodularity. In Mathematica Slovaca, vol. 60, no.2, pp. 157-170. 0139-9918. DOI: https://doi.org/10.2478/s12175-010-0002-1

APA:
Csontóová, M., Lihová, J. (2010). Graph isomorphic discrete partially ordered sets and semimodularity. Mathematica Slovaca, 60(2), 157-170. 0139-9918. DOI: https://doi.org/10.2478/s12175-010-0002-1
About edition: