A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
New upper bound for the chromatic number of a random subgraph of a distance graph
New upper bound for the chromatic number of a random subgraph of a distance graph
New upper bound for the chromatic number of a random subgraph of a distance graph
Gusev, A. S. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 97 ; 326-332
2015-01-01
7 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
On large subgraphs of a distance graph which have small chromatic number
| British Library Online Contents | 2014
Distance graphs with large chromatic number and without large cliques
| British Library Online Contents | 2010
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
| British Library Online Contents | 2011
Independence numbers of random subgraphs of a distance graph
| British Library Online Contents | 2016