DocumentCode
1178737
Title
Thickness of graphs with degree constrained vertices
Author
Bose, N.K. ; Prabhu, K.A.
Volume
24
Issue
4
fYear
1977
fDate
4/1/1977 12:00:00 AM
Firstpage
184
Lastpage
190
Abstract
Simple formulas are obtained for the thickness of complete and complete bipartite graphs when the degrees of the vertices of the planar subgraphs are constrained by the requirements of routing in rectilinear metric, using essentially Euler´s formula and certain constructive procedures. These results are also suitable for adaptation in graphs with other degree constraints on vertices, and are potentially useful in the routing of multinets on multilayers.
Keywords
Graph theory; Bipartite graph; Euclidean distance; Large-scale systems; Nonhomogeneous media; Routing; Thick film circuits;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1977.1084323
Filename
1084323
Link To Document