You are not currently logged in.
Access JSTOR through your library or other institution:
On the Planar Decomposition of a Complete Bipartite Graph
Isao Shirakawa, Hiromitsu Takahashi and Hiroshi Ozaki
SIAM Journal on Applied Mathematics
Vol. 16, No. 2 (Mar., 1968), pp. 408-416
Published by: Society for Industrial and Applied Mathematics
Stable URL: http://www.jstor.org/stable/2099303
Page Count: 9
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper considers the planar decomposition of a complete bipartite graph, that is, the decomposition of a complete bipartite graph into planar subgraphs such that the union of all these planar subgraphs is the original complete bipartite graph and any two of them have no edge in common. This problem is motivated by the synthesis of a given logical network consisting only of NOR and/or NAND elements with as few integrated circuits as possible. The main result of this paper is that the smallest number of planar subgraphs into which a complete bipartite graph Kn,n can be decomposed does not exceed [ n/3] + 1, where [ x ] stands for the minimum integer not less than x.
SIAM Journal on Applied Mathematics © 1968 Society for Industrial and Applied Mathematics