Open AccessOn the complexity for constructing a 3-colouring for planar graphs with short facets
Author(s) -
Dmitry Sirotkin
Publication year - 2018
Publication title -
žurnal srednevolžskogo matematičeskogo obŝestva
Language(s) - English
Resource type - Journals
eISSN - 2587-7496
pISSN - 2079-6900
DOI - 10.15507/2079-6900.20.201802.199-205
Subject(s) - planar graph , combinatorics , planar , mathematics , computer science , graph , computer graphics (images)