Article contents
Note on T-Minimal Complete Bipartite Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
The thickness of a graph G is the smallest natural number t such that G is the union of t planar subgraphs. A graph G is t-minimal if its thickness is t and if every proper subgraph of G has thickness < t. (These terms were introduced by Tutte in [3]. In [1, p. 51] Beineke employs the term t-critical instead of t-minimal.) The complete bipartite graph K(m, n) consists of m 'dark1 points, n 'light' points, and the mn lines joining points of different types.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1968
References
- 5
- Cited by