Bounds on the Coarseness of the n-Cube
- 1 June 1979
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 22 (2) , 171-175
- https://doi.org/10.4153/cmb-1979-024-2
Abstract
The coarseness, c(G), of a graph G is the maximum number of edge disjoint nonplanar subgraphs contained in G For the n-dimensional cube Qn we obtain the inequalitiesKeywords
This publication has 6 references indexed in Scilit:
- The homeomorphic embedding of Kn in the m-cubeDiscrete Mathematics, 1976
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- The Coarseness of the Complete Bipartite GraphCanadian Journal of Mathematics, 1969
- The Coarseness of the Complete GraphCanadian Journal of Mathematics, 1968
- A coarseness conjecture of ErdösJournal of Combinatorial Theory, 1967
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930