Some results on clique partitions of regular graphs

• المؤلفون الرئيسيون: Escaner, Jona Kristine E., Inocencio, Arlene R.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 1999
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_bachelors/16566

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...