The Outerthickness & Outercoarseness of Graphs I. The Complete Graph & The n-Cube
R. Kent Guy, Richard J. Nowakowski · 1990
Many of the results of this paper were announced without proof in [9]; a parallel paper, discussing the complete bipartite graph, will appear in [11]. Some results were also obtained independently by L.S. Mel’nikov and presented at the 6th Hungarian Combinatorics Colloquium in Eger on 81-07-10. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.