On the Slupecki classes in the systems Pkx ... x Pl

S. S. MARCHENKOV

doi:10.1515/dma.1993.3.2.147

Home Mathematics On the Slupecki classes in the systems Pkx ... x Pl

Article

Licensed

Unlicensed Requires Authentication

On the Slupecki classes in the systems P_kx ... x P_l

S. S. MARCHENKOV

Published/Copyright: October 9, 2009

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

From the journal Volume 3 Issue 2

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

MARCHENKOV, S. S.. "On the Slupecki classes in the systems P_kx ... x P_l" Discrete Mathematics and Applications, vol. 3, no. 2, 1993, pp. 147-160. https://doi.org/10.1515/dma.1993.3.2.147

MARCHENKOV, S. (1993). On the Slupecki classes in the systems P_kx ... x P_l. Discrete Mathematics and Applications, 3(2), 147-160. https://doi.org/10.1515/dma.1993.3.2.147

MARCHENKOV, S. (1993) On the Slupecki classes in the systems P_kx ... x P_l. Discrete Mathematics and Applications, Vol. 3 (Issue 2), pp. 147-160. https://doi.org/10.1515/dma.1993.3.2.147

MARCHENKOV, S. S.. "On the Slupecki classes in the systems P_kx ... x P_l" Discrete Mathematics and Applications 3, no. 2 (1993): 147-160. https://doi.org/10.1515/dma.1993.3.2.147

MARCHENKOV S. On the Slupecki classes in the systems P_kx ... x P_l. Discrete Mathematics and Applications. 1993;3(2): 147-160. https://doi.org/10.1515/dma.1993.3.2.147

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2009-10-09

Published in Print: 1993

Walter de Gruyter

You are currently not able to access this content.

Articles in the same Issue

On transportation polytopes with the minimum number of k-faces
The scheme complexity of discrete optimization
On the Slupecki classes in the systems P_kx ... x P_l
On the number of summands in the Hilbert-Kamke problem in prime numbers
On a classification of quasigroups by properties of their T-partitions
An asymptotic formula for the number of identity graphs
On the entropy values of hereditary classes of graphs
Random minimal coverings of sets
Some classes of substitutions with cycle lengths from a given set
Allocations with reflection, waiting time

Search journal Search the content of this journal

https://doi.org/10.1515/dma.1993.3.2.147

Articles in the same Issue

On transportation polytopes with the minimum number of k-faces
The scheme complexity of discrete optimization
On the Slupecki classes in the systems P_kx ... x P_l
On the number of summands in the Hilbert-Kamke problem in prime numbers
On a classification of quasigroups by properties of their T-partitions
An asymptotic formula for the number of identity graphs
On the entropy values of hereditary classes of graphs
Random minimal coverings of sets
Some classes of substitutions with cycle lengths from a given set
Allocations with reflection, waiting time