Some results on clique partitions of regular graphs
This thesis discusses the partitioning of the edges of a simple connected 3-regular graph into a minimum number of complete subgraphs. This is called a minimum clique partition of the graph. Results are focused on various techniques in obtaining the exact values and bounds of the size of a minimum c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1999
|
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16566 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-17079 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-170792021-12-03T03:37:13Z Some results on clique partitions of regular graphs Escaner, Jona Kristine E. Inocencio, Arlene R. This thesis discusses the partitioning of the edges of a simple connected 3-regular graph into a minimum number of complete subgraphs. This is called a minimum clique partition of the graph. Results are focused on various techniques in obtaining the exact values and bounds of the size of a minimum clique partition of a 3-regular graph. A discussion on externally adjacent vertices and separation of cliques is also presented. 1999-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16566 Bachelor's Theses English Animo Repository |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| description |
This thesis discusses the partitioning of the edges of a simple connected 3-regular graph into a minimum number of complete subgraphs. This is called a minimum clique partition of the graph. Results are focused on various techniques in obtaining the exact values and bounds of the size of a minimum clique partition of a 3-regular graph. A discussion on externally adjacent vertices and separation of cliques is also presented. |
| format |
text |
| author |
Escaner, Jona Kristine E. Inocencio, Arlene R. |
| spellingShingle |
Escaner, Jona Kristine E. Inocencio, Arlene R. Some results on clique partitions of regular graphs |
| author_facet |
Escaner, Jona Kristine E. Inocencio, Arlene R. |
| author_sort |
Escaner, Jona Kristine E. |
| title |
Some results on clique partitions of regular graphs |
| title_short |
Some results on clique partitions of regular graphs |
| title_full |
Some results on clique partitions of regular graphs |
| title_fullStr |
Some results on clique partitions of regular graphs |
| title_full_unstemmed |
Some results on clique partitions of regular graphs |
| title_sort |
some results on clique partitions of regular graphs |
| publisher |
Animo Repository |
| publishDate |
1999 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16566 |
| _version_ |
1772835121246765056 |