• Title of article

    Colorings and homomorphisms of degenerate and bounded degree graphs Original Research Article

  • Author/Authors

    A. Kostochka، نويسنده , , J. Ne?et?il، نويسنده , , P. Smol??kov?، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2001
  • Pages
    20
  • From page
    257
  • To page
    276
  • Abstract
    We are interested here in homomorphisms of undirected graphs and relate them to graph degeneracy and bounded degree property. Our main result reads that both in the abundance of counterexamples and from the complexity point of view the Brooksʹs theorem and first fit algorithm are the ‘only’ easy cases.
  • Journal title
    Discrete Mathematics
  • Serial Year
    2001
  • Journal title
    Discrete Mathematics
  • Record number

    949654

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