Title of article
A new proof of Grünbaumʹs 3 color theorem
Author/Authors
O.V. Borodin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
7
From page
177
To page
183
Abstract
A simple proof of Grünbaumʹs theorem on the 3-colourability of planar graphs having at most three 3-cycles is given, which does not employ the colouring extension.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951477
Link To Document