Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

On the Maximum Average Degree and the Oriented Chromatic Number of a Graph

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • Contributors:
      The Pennsylvania State University CiteSeerX Archives
    • الموضوع:
      1999
    • Collection:
      CiteSeerX
    • نبذة مختصرة :
      The oriented chromatic number o(H) of an oriented graph H is dened as the minimum order of an oriented graph H 0 such that H has a homomorphism to H 0 . The oriented chromatic number o(G) of an undirected graph G is then dened as the maximum oriented chromatic number of its orientations. In this paper we study the links between o(G) and mad(G) dened as the maximum average degree of the subgraphs of G. Keywords. Oriented graph colouring, Graph homomorphism, Maximum average degree. 1
    • File Description:
      application/postscript
    • Relation:
      http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1498; http://dept-info.labri.u-bordeaux.fr/~sopena/Papiers/Comprimes/bknrs99.ps.gz
    • الدخول الالكتروني :
      http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1498
      http://dept-info.labri.u-bordeaux.fr/~sopena/Papiers/Comprimes/bknrs99.ps.gz
    • Rights:
      Metadata may be used without restrictions as long as the oai identifier remains attached to it.
    • الرقم المعرف:
      edsbas.FEB36FD3