| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 889 4 |
| Ultima descărcare din IBN: 2017-11-27 15:10 |
| Căutarea după subiecte similare conform CZU |
| 519.174.1 (1) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012TALMACIU, Mihai. On a k-clique-join of a class of partitionable graphs. In: Computer Science Journal of Moldova, 2005, nr. 1(37), pp. 37-46. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Computer Science Journal of Moldova | ||||||
| Numărul 1(37) / 2005 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.174.1 | ||||||
| Pag. 37-46 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We call a graph G O-graph if there is an optimal coloring of e set of vertices and an optimal (disjoint) covering with cliques such that any class of colors intersects any clique. In this paper, has been established the relation to [p; q; r]-partite graphs and the fact that the O-graphs admit a k-clique-join. |
||||||
| Cuvinte-cheie perfect graphs, (®, partitionable graphs, [p, r]-partite graphs, k-clique-join., q |
||||||
|
|
|
|
