Article contents
Bounds on the Coarseness of the n-Cube
Published online by Cambridge University Press: 20 November 2018
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 inequalities
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1979
References
- 2
- Cited by