| Autor: |
Mihai Talmaciu |
| Jazyk: |
angličtina |
| Rok vydání: |
2005 |
| Předmět: |
|
| Zdroj: |
Computer Science Journal of Moldova, Vol 13, Iss 1(37), Pp 37-46 (2005) |
| Druh dokumentu: |
article |
| ISSN: |
1561-4042 |
| Popis: |
We call a graph G O-graph if there is an optimal coloring of the set of vertices and an optimal (disjoint) covering with cliques such that any class of colors intersects any clique. In this paper, it has been established the relation to [p,q,r]-partite graphs and the fact that the O-graphs admit a k-clique-join. American Mathematical Society (2000): 05C17. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
