Geodesic
Note on T-Minimal Complete Bipartite Graphs
Canadian mathematical bulletin, Tome 11 (1968) no. 5, pp. 729-732

Voir la notice de l'article provenant de la source Cambridge

DOI

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. 
Bouwer, I. Z.; Broere, I. Note on T-Minimal Complete Bipartite Graphs. Canadian mathematical bulletin, Tome 11 (1968) no. 5, pp. 729-732. doi: 10.4153/CMB-1968-088-x
@article{10_4153_CMB_1968_088_x,
     author = {Bouwer, I. Z. and Broere, I.},
     title = {Note on {T-Minimal} {Complete} {Bipartite} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {729--732},
     year = {1968},
     volume = {11},
     number = {5},
     doi = {10.4153/CMB-1968-088-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-088-x/}
}
TY  - JOUR
AU  - Bouwer, I. Z.
AU  - Broere, I.
TI  - Note on T-Minimal Complete Bipartite Graphs
JO  - Canadian mathematical bulletin
PY  - 1968
SP  - 729
EP  - 732
VL  - 11
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-088-x/
DO  - 10.4153/CMB-1968-088-x
ID  - 10_4153_CMB_1968_088_x
ER  - 
%0 Journal Article
%A Bouwer, I. Z.
%A Broere, I.
%T Note on T-Minimal Complete Bipartite Graphs
%J Canadian mathematical bulletin
%D 1968
%P 729-732
%V 11
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-088-x/
%R 10.4153/CMB-1968-088-x
%F 10_4153_CMB_1968_088_x

Cité par Sources :