A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
Moskva, V. F. (author) / Raigorodskii, A. M. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 89 ; 307-308
2011-01-01
2 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
| British Library Online Contents | 2014
Lower bounds for the chromatic numbers of distance graphs with large girth
| British Library Online Contents | 2017
Independence numbers of random subgraphs of distance graphs
| British Library Online Contents | 2016
On the independence number of distance graphs with vertices in {?1, 0, 1} n
| British Library Online Contents | 2009
Independence numbers of random subgraphs of a distance graph
| British Library Online Contents | 2016