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

The mixed hypergraphs

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • بيانات النشر:
      Vladimir Andrunachievici Institute of Mathematics and Computer Science
    • الموضوع:
      1993
    • Collection:
      Directory of Open Access Journals: DOAJ Articles
    • نبذة مختصرة :
      We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a hypergraph H and denoted by `c(H). The general algorithm for computing the numbers of all colorings of mixed (containing edge and anti-edge sets) hypergraphs is proposed. Some properties of mixed hypergraph colorings and its application are discussed.
    • ISSN:
      1561-4042
    • Relation:
      http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n1/v1-n1-(pp45-52).pdf; https://doaj.org/toc/1561-4042; https://doaj.org/article/5e128dda358748f1984f5335b3e527c4
    • الرقم المعرف:
      edsbas.DA8C4E7C