New upper bounds for the independence numbers of graphs with vertices in {−1, 0, 1} n and their applications to problems of the chromatic numbers of distance graphs
Crossref DOI link: https://doi.org/10.1134/S000143461407013X
Published Online: 2014-08-21
Published Print: 2014-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ponomarenko, E. I.
Raigorodskii, A. M.
Text and Data Mining valid from 2014-07-01