DC FieldValueLanguage
dc.contributor.authorTodorčević, Stevoen
dc.date.accessioned2020-05-01T20:29:30Z-
dc.date.available2020-05-01T20:29:30Z-
dc.date.issued1988-01-01en
dc.identifier.issn0097-3165en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2267-
dc.description.abstractIt is proved that every chain-complete poset with the finite cutset property is the union of countably many chains.en
dc.publisherElsevier-
dc.relation.ispartofJournal of Combinatorial Theory, Series Aen
dc.titleA chain decomposition theoremen
dc.typeArticleen
dc.identifier.doi10.1016/0097-3165(88)90075-1en
dc.identifier.scopus2-s2.0-45549117508en
dc.relation.firstpage65en
dc.relation.lastpage76en
dc.relation.issue1en
dc.relation.volume48en
dc.description.rankM21-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
crisitem.author.orcid0000-0003-4543-7962-
Show simple item record

Page view(s)

2
checked on Sep 7, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.