• Title of article

    On the NP-completeness of the k-colorability problem for triangle-free graphs

  • Author/Authors

    Frédéric Maffray، نويسنده , , Myriam Preissmann، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1996
  • Pages
    5
  • From page
    313
  • To page
    317
  • Abstract
    We show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to the class of triangle-free graphs with maximum degree 4. Likewise the question “Is a triangle-free graph k-colorable?” is shown to be NP-complete for any fixed value of k ⩾ 4.
  • Journal title
    Discrete Mathematics
  • Serial Year
    1996
  • Journal title
    Discrete Mathematics
  • Record number

    944081

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