• Title of article

    The 4-Choosability of Plane Graphs without 4-Cycles

  • Author/Authors

    Peter Che Bor Lam، نويسنده , , Peter and Xu، نويسنده , , Baogang and Liu، نويسنده , , Jiazhuang، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1999
  • Pages
    10
  • From page
    117
  • To page
    126
  • Abstract
    A graphGis calledk-choosable ifkis a number such that if we give lists ofkcolors to each vertex ofGthere is a vertex coloring ofGwhere each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosable.
  • Keywords
    list coloring , plane graph , 4-Cycle , Choosability
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1999
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526494

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