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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.