Minimum 2-clique and 3-clique partitions of simple connected graphs
The researcher presents a computer-based procedure in determining the minimum number of 2-cliques and 3-cliques that can partition any given simple, connected graph G with degrees not exceeding four and with order n where 2 is less than or equal to n less than or equal to 12.
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1992
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/15965 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |