Geodesic
An upper bound on the chromatic number of 2-planar graphs
Discussiones Mathematicae. Graph Theory, Tome 43 (2023) no. 3, pp. 703-720

Voir la notice de l'article provenant de la source Library of Science

It is proved that any 2-planar graph (i.e., a graph which can be drawn on a plane such that any edge intersects at most two others) has a proper vertex coloring with 9 colors.
Keywords: 2-planar graphs, chromatic number 
@article{DMGT_2023_43_3_a7,
     author = {Karpov, Dmitri V.},
     title = {An upper bound on the chromatic number of 2-planar graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {703--720},
     publisher = {mathdoc},
     volume = {43},
     number = {3},
     year = {2023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2023_43_3_a7/}
}
TY  - JOUR
AU  - Karpov, Dmitri V.
TI  - An upper bound on the chromatic number of 2-planar graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2023
SP  - 703
EP  - 720
VL  - 43
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2023_43_3_a7/
LA  - en
ID  - DMGT_2023_43_3_a7
ER  - 
%0 Journal Article
%A Karpov, Dmitri V.
%T An upper bound on the chromatic number of 2-planar graphs
%J Discussiones Mathematicae. Graph Theory
%D 2023
%P 703-720
%V 43
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2023_43_3_a7/
%G en
%F DMGT_2023_43_3_a7
Karpov, Dmitri V. An upper bound on the chromatic number of 2-planar graphs. Discussiones Mathematicae. Graph Theory, Tome 43 (2023) no. 3, pp. 703-720. http://geodesic.mathdoc.fr/item/DMGT_2023_43_3_a7/