Funder
National Natural Science Foundation of China
Scientific Research Foundation of Hunan Provincial Education Department
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300–343 (1984)
2. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42, 1803–1829 (2013)
3. Christian, R., Richter, R.B., Salazar, G.: Zarankiewicz’s Conjecture is finite for each fixed $$m$$. J. Combin. Theory Ser. B 103, 237–247 (2013)
4. Clancy, K., Haythorpe, M., Newcombe, A.: A survey of graphs with known or bounded crossing numbers (2019). arXiv:1901.05155
5. Ding, Z., Huang, Y.: The crossing numbers of join of some graphs with $$n$$ isolated vertices. Discuss. Math. Graph Theory 38, 899–909 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献