Note on T-Minimal Complete Bipartite Graphs
1968 ◽
Vol 11
(5)
◽
pp. 729-732
◽
Keyword(s):
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.
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽
Keyword(s):
2013 ◽
Vol 3
(3)
◽
pp. 390-396
◽
Keyword(s):
2015 ◽
pp. 55-58
2021 ◽
Vol 12
(2)
◽
pp. 1040-1046