• Title of article

    Hard coloring problems in low degree planar bipartite graphs Original Research Article

  • Author/Authors

    Miroslav Chleb?k، نويسنده , , Janka Chleb?kov?، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2006
  • Pages
    6
  • From page
    1960
  • To page
    1965
  • Abstract
    In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polynomially solvable, but even its restricted version with 3 colors is NP-complete on planar bipartite graphs of maximum degree 4.
  • Keywords
    List coloring , PreColoring , Planar graphs
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    2006
  • Journal title
    Discrete Applied Mathematics
  • Record number

    886342

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