Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5417
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBagchi, Bhaskar-
dc.contributor.authorBagchi, Sunanda-
dc.contributor.authorMukhopadhyay, A C-
dc.date.accessioned2013-06-13T12:50:02Z-
dc.date.available2013-06-13T12:50:02Z-
dc.date.issued1992-
dc.identifier.citationArs Combinatoria,v. 33, p.238-244en_US
dc.identifier.urihttp://hdl.handle.net/10263/5417-
dc.language.isoenen_US
dc.subjectMappings of netsen_US
dc.subjectDisjoint setsen_US
dc.subjectOptimal statistical designsen_US
dc.titleCovering morphisms between netsen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
AC-33-1992-P238-243.pdf436.25 kBAdobe PDFView/Open


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