Publisher
Springer International Publishing
Reference23 articles.
1. Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. Algorithmica 82(9), 2564–2585 (2020). https://doi.org/10.1007/s00453-020-00697-4
2. Bannister, M.J., Devanny, W.E., Dujmovic, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561–1583 (2019). https://doi.org/10.1007/s00453-018-0487-5
3. Barth, D., Pellegrini, F., Raspaud, A., Roman, J.: On bandwidth, cutwidth, and quotient graphs. RAIRO Theor. Inform. Appl. 29(6), 487–508 (1995). https://doi.org/10.1051/ita/1995290604871
4. Bekos, M.A., et al.: Planar graphs of bounded degree have bounded queue number. SIAM J. Comput. 48(5), 1487–1502 (2019). https://doi.org/10.1137/19M125340X
5. Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: On the queue number of planar graphs. CoRR arXiv:2106.08003 (2021)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Rique-Number of Graphs;Lecture Notes in Computer Science;2023
2. The Family of Fan-Planar Graphs;WALCOM: Algorithms and Computation;2023