Author:
Guy Richard K.,Beineke Lowell W.
Abstract
The coarseness, c(G), of a graph G is the maximum number of edge-disjoint, non-planar subgraphs of G. We consider only the complete graph, Kp, on p vertices here. For p = 3r, Erdös conjectured that the coarseness was , but it has been shown (1) that1where square brackets denote integer part.
Publisher
Canadian Mathematical Society
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献