Clique coverings and clique partitions of the K-power of graphs
Let G be any graph. A clique covering of G is a set of cliques of G, which together contain each edge of G at least once. The smallest cardinality of clique coverings of G is called the clique covering number of G, and is denoted by cc(G). A clique partition of G is a set of cliques of G, which toge...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
Chulalongkorn University
2007
|
| 在線閱讀: | https://digiverse.chula.ac.th/Info/item/dc:38714 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|