Study on Thickness Calculation Method for Undigraph
Автор: Yan Cui, Chao-Dong Cui
Журнал: International Journal of Wireless and Microwave Technologies(IJWMT) @ijwmt
Статья в выпуске: 1 Vol.1, 2011 года.
Бесплатный доступ
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
Короткий адрес: https://sciup.org/15012722
IDR: 15012722
Список литературы Study on Thickness Calculation Method for Undigraph
- Wang Shuhe. Graph theory. Science Press, 2008, pp130-137.
- Tian Wencheng, Zhou Luxin. Discrete Mathematics. Tianjin University Press, 2001, pp187-225.
- Yan Cui. Chao-Dong Cui , “Research on necessary and sufficient condition for Hamilton graph,” 2010 2rd International Conference on Intellectual Technique in Industrial Practice. China, vol. 1, pp.376–380, September 2010.
- Ainouche A, Kouider M. Hamiltonism and partially square graphs[J]. Graphs and Combinatorics, 1999,15(3): 257 265.
- Liu,Yiping,Tian,Feng,Wu,Zhengsheng. “Sequence concerning Hamiltonicity of graphs” Journal of Nanjing Normal University(Natural Science),1995,18(1):19~28.
- Min Xu “Several New Results on Hamiltonicity of Graphs” Outstanding Dissertation of Chinese text databases 2002,(02)
- li-li Zhang “Several Sufficient Conditions on Hamiltonian Properties in Graphs” Outstanding Dissertation of Chinese text databases, 2002,(02)
- Jin Yang “Several Sufficient Conditions for Hamiltonian Graphs” Outstanding Dissertation of Chinese text databases, 2003,(02)
