Geodesic
On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number
Matematičeskie zametki, Tome 96 (2014) no. 2, pp. 318-320

Voir la notice de l'article provenant de la source Math-Net.Ru

Keywords: coloring problem, distance graph, chromatic number, random graph. 
@article{MZM_2014_96_2_a17,
     author = {A. A. Kokotkin},
     title = {On {Large} {Subgraphs} of a {Distance} {Graph} {Which} {Have} {Small} {Chromatic} {Number}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {318--320},
     publisher = {mathdoc},
     volume = {96},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/}
}
TY  - JOUR
AU  - A. A. Kokotkin
TI  - On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number
JO  - Matematičeskie zametki
PY  - 2014
SP  - 318
EP  - 320
VL  - 96
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/
LA  - ru
ID  - MZM_2014_96_2_a17
ER  - 
%0 Journal Article
%A A. A. Kokotkin
%T On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number
%J Matematičeskie zametki
%D 2014
%P 318-320
%V 96
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/
%G ru
%F MZM_2014_96_2_a17
A. A. Kokotkin. On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number. Matematičeskie zametki, Tome 96 (2014) no. 2, pp. 318-320. http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/