Author:
Liu Yunlong,Chen Jie,Huang Jingui
Publisher
Springer International Publishing
Reference12 articles.
1. Bilski, T.: Optimum embedding of complete graphs in books. Discrete Math. 182(1–3), 21–28 (1998)
2. Ganley, J.L., Heath, L.S.: The page number of $$k$$-trees is $$O(k)$$. Discrete Appl. Math. 109(3), 215–221 (2001)
3. Hong, S.-H., Nagamochi, H.: Simpler algorithms for testing two-page book embedding of partitioned graphs. Theoret. Comput. Sci. 725, 79–98 (2018)
4. Lecture Notes in Computer Science;S Bhore,2019
5. Dujmović, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theoret. Comput. Sci. 6, 339–358 (2004)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献