A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
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
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
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
Ponomarenko, E. I. (author) / Raigorodskii, A. M. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 96 ; 140-148
2014-01-01
9 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
| British Library Online Contents | 2011
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 structure of distance graphs with large chromatic numbers
| British Library Online Contents | 2006
Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra
| British Library Online Contents | 2007