• Title of article

    A non-3-choosable planar graph without cycles of length 4 and 5 Original Research Article

  • Author/Authors

    M. Voigt، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2007
  • Pages
    3
  • From page
    1013
  • To page
    1015
  • 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
    Choosability , Planar graphs , Forbidden cycles
  • Journal title
    Discrete Mathematics
  • Serial Year
    2007
  • Journal title
    Discrete Mathematics
  • Record number

    947743

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=947743