• Title of article

    Some new hereditary classes where graph coloring remains NP-hard

  • Author/Authors

    D. Schindl، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2005
  • Pages
    6
  • From page
    197
  • To page
    202
  • Abstract
    The graph coloring problem is image-hard in the set of all graphs. In this note we combine two problem reductions to provide a collection of hereditary classes of graphs for which the graph coloring problem remains image-hard when restricted to it.
  • Keywords
    Graph coloring , Hereditary classes , Line graph , Partial subgraph , Induced subgraph
  • Journal title
    Discrete Mathematics
  • Serial Year
    2005
  • Journal title
    Discrete Mathematics
  • Record number

    948507

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