Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your 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
Stable URL: http://www.jstor.org/stable/2099303
Page Count: 9
  • Subscribe ($19.50)
  • Cite this Item
On the Planar Decomposition of a Complete Bipartite Graph
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
408
    408
  • Thumbnail: Page 
409
    409
  • Thumbnail: Page 
410
    410
  • Thumbnail: Page 
411
    411
  • Thumbnail: Page 
412
    412
  • Thumbnail: Page 
413
    413
  • Thumbnail: Page 
414
    414
  • Thumbnail: Page 
415
    415
  • Thumbnail: Page 
416
    416