Paul August Winter
Published 2013-03-19Version 1
In this paper we introduce a different kind of graph energy, the minimum 3-covering energy of a graph, and determine the minimum 3-covering energy of complete graphs.
Edge-transitive embeddings of complete graphs
Partite Saturation of Complete Graphs
On the Ramsey number of a cycle and complete graphs
![QR code for arXiv:1303.4579 [math.CO]](http://oss.arxitics.com/images/favicon.svg)