Results

eNauka >  Results >  Covering complete graphs by monochromatically bounded sets
Title: Covering complete graphs by monochromatically bounded sets
Authors: Milićević, Luka  
Issue Date: 2019
Publication: Applicable Analysis and Discrete Mathematics
ISSN: 1452-8630 Applicable Analysis and Discrete Mathematics Search Idenfier
Publisher: School of Electrical Engineering, University of Belgrade
Type: Article
Collation: vol. 13 br. 1 str. 85-110
DOI: 10.2298/aadm170204022m
WoS-ID: 000465282900005
Scopus-ID: 2-s2.0-85065543292
URI: http://researchrepository.mi.sanu.ac.rs/handle/123456789/1042
https://enauka.gov.rs/handle/123456789/398168
Project: Representations of logical structures and formal languages and their application in computing
Metadata source: Migracija
M-category: 
21aM21a

4
SCOPUSTM
4
WEB OF SCIENCETM
Altmetric
Dimensions
Unpaywall

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