A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
Wang, Z.W. (author) / Zhu, G.
Advanced Materials and Computer Science ; 2341-2346
KEY ENGINEERING MATERIALS ; 474/476
2011-01-01
6 pages
Article (Journal)
English
DDC:
620.11
© 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
New upper bound for the chromatic number of a random subgraph of a distance graph
| British Library Online Contents | 2015
On the chromatic number of finite systems of subsets
| British Library Online Contents | 2009
Lovász’ theorem on the chromatic number of spheres revisited
| British Library Online Contents | 2015
Distance graphs with large chromatic number and without large cliques
| British Library Online Contents | 2010