Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/30181
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mikalački Mirjana | - |
dc.date.accessioned | 2020-12-14T17:55:43Z | - |
dc.date.available | 2020-12-14T17:55:43Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/30181 | - |
dc.language.iso | en | - |
dc.relation.ispartof | 5th Polish Combinatorial Conference Abstracts, 5th Polish Combinatorial Conference, Bedlevo, Poljska, 2014, 22-26 septembar, 2014 | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | How fast can Maker win in biased games on E(Kn)? | en |
dc.type | Conference Paper | en |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=90342&source=BEOPEN&language=en | en |
dc.relation.lastpage | 39 | - |
dc.relation.firstpage | 39 | - |
dc.identifier.externalcrisreference | (BISIS)90342 | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.