A new proof of Grunbaum's 3 color theorem

被引:11
作者
Borodin, OV [1 ]
机构
[1] RUSSIAN ACAD SCI,INST MATH,SIBERIAN BRANCH,NOVOSIBIRSK 630090,RUSSIA
关键词
D O I
10.1016/0012-365X(95)00984-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:177 / 183
页数:7
相关论文
共 10 条
  • [1] Aksenov V.A., 1974, DISKRET ANAL NOVOSIB, V26, P3
  • [2] Borodin O. V., 1984, Metody Diskret. Analiz., V108, P12
  • [3] ACYCLIC COLORINGS OF PLANAR GRAPHS
    BORODIN, OV
    [J]. DISCRETE MATHEMATICS, 1979, 25 (03) : 211 - 236
  • [4] BORODIN OV, 1976, PROOF GRUNBAUMS CONJ, V231, P18
  • [5] GROTZSCH H, 1958, WISS Z M LUTHER U MN, V8, P109
  • [6] Grunbaum B., 1963, MICH MATH J, V10, P303
  • [7] Jensen T. R., 1995, Graph Coloring Problems
  • [8] ORE O, 1967, 4 COLOR PROBLEM
  • [9] SACHS H, 1972, EINFURUNG THEORIE EN, V2
  • [10] Steinberg R., 1993, ANN DISCR M, V55, P211, DOI DOI 10.1016/S0167-5060(08)70391-1