• Title of article

    Applications of hypergraph coloring to coloring graphs not inducing certain trees Original Research Article

  • Author/Authors

    H.A. Kierstead، نويسنده , , V. Rodl، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1996
  • Pages
    7
  • From page
    187
  • To page
    193
  • Abstract
    We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees.
  • Journal title
    Discrete Mathematics
  • Serial Year
    1996
  • Journal title
    Discrete Mathematics
  • Record number

    943717

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