• Title of article

    On simultaneous colorings of embedded graphs Original Research Article

  • Author/Authors

    Daniel P. Sanders، نويسنده , , John Maharry، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2000
  • Pages
    8
  • From page
    207
  • To page
    214
  • Abstract
    In this paper, it is shown that if the maximum degree Δ of a graph is large relative to the genus of the embedding than the edge-face chromatic number of the graph is at most Δ+1 and its vertex-edge-face chromatic number is at most Δ+2. Both results are best possible.
  • Journal title
    Discrete Mathematics
  • Serial Year
    2000
  • Journal title
    Discrete Mathematics
  • Record number

    950586

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