|
|||||
|
|
A non-3-choosable planar graph without cycles of length 4 and 5 |
|
| Institution: | University of Applied Sciences, D-01069 Dresden, Germany |
| Abstract: | Steinberg's question from 1975 whether every planar graph without 4- and 5-cycles is 3-colorable is still open. In this paper the analogous question for 3-choosability of such graphs is answered to the negative. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |