Open AccessAn upper bound on the chromatic number of 2-planar graphs
Author(s) -
D. V. Karpov
Publication year - 2021
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2397
Subject(s) - mathematics , combinatorics , chromatic scale , planar graph , upper and lower bounds , planar , discrete mathematics , graph , computer science , mathematical analysis , computer graphics (images)
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom