• Title of article

    3-List-Coloring Planar Graphs of Girth 5

  • Author/Authors

    Thomassen، نويسنده , , C.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1995
  • Pages
    7
  • From page
    101
  • To page
    107
  • Abstract
    We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch′s theorem that every planar graph of girth at least 4 is 3-colorable.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1995
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526015

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