Journal article

Coloring some classes of mixed graphs

    2007
Published in:
  • Discrete Applied Mathematics. - 2007, vol. 155, no. 1, p. 1-6
English We consider the coloring problem for mixed graphs, that is, for graphs containing edges and arcs.A mixed coloring c is a coloring such that for every edge [xi, xj], c(xi ) ≠ c(xj ) and for every arc (xp, xq ), c(xp)
Faculty
Faculté des sciences économiques et sociales
Department
Département d'informatique
Language
  • English
Classification
Computer science
License
License undefined
Identifiers
Persistent URL
https://folia.unifr.ch/unifr/documents/307714
Statistics

Document views: 4 File downloads:
  • coloringmixedgraphsi.pdf: 3