期刊名称：International Journal of Wireless and Microwave Technologies(IJWMT)
印刷版ISSN：2076-1449
电子版ISSN：2076-9539
出版年度：2011
卷号：1
期号：1
页码：59-66
出版社：MECS Publisher
摘要：How to solve the thickness of general graph is an unsolved problem and one of many difficult problems in graph theory. This paper studies the method for calculating the thickness of undigraph and proposes formula and concrete method for calculating the thickness of undigraph G. Meanwhile, method is proposed for testing whether division of side-derived subgraphs is correct. Some instances presented in this paper aims at illustrating the actual application and correctness of calculation of this method for reference.
关键词：Thickness of Graph; Side-Derived Subgraph; Maximal Planar Graph;Nonplanar Graph; Euler’s Planar Graph Formula
