A simple proof of Grunbaum's theorem on the 3-colourability of planar graphs having at most three 3-cycles is given, which does not employ the colouring extension.
机构:
Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow
Moscow Institute of Physics and Technology, Institutskii per. 9, Dolgoprudnyi, Moscow oblastDepartment of Computational Mathematics and Cybernetics, Moscow State University, Moscow
机构:
Northeast Normal Univ, Ctr Math & Interdisciplinary Sci, Sch Math & Stat, Changchun 130024, Peoples R ChinaNortheast Normal Univ, Ctr Math & Interdisciplinary Sci, Sch Math & Stat, Changchun 130024, Peoples R China
Liu, Chang
Xing, Jiamin
论文数: 0引用数: 0
h-index: 0
机构:
Northeast Normal Univ, Ctr Math & Interdisciplinary Sci, Sch Math & Stat, Changchun 130024, Peoples R ChinaNortheast Normal Univ, Ctr Math & Interdisciplinary Sci, Sch Math & Stat, Changchun 130024, Peoples R China
Xing, Jiamin
JOURNAL OF APPLIED ANALYSIS AND COMPUTATION,
2022,
12
(04):
: 1679
-
1701