Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference63 articles.
1. Alam, J.M., Bekos, M.A., Dujmović, V., Gronemann, M., Kaufmann, M., Pupyrev, S.: On dispersable book embeddings. Theoret. Comput. Sci. 861, 1–22 (2021)
2. Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: On the book thickness of 1-planar graphs (2015). arXiv:1510.05891
3. Ambrus, G., Barát, J., Hajnal, P.: The slope parameter of graphs. Acta Sci. Math. (Szeged) 72(3–4), 875–889 (2006)
4. Barát, J., Matoušek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electron. J. Comb. 13, # R3 (2006)
5. Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science (Bad Honnef 2004). Lecture Notes in Computer Science, vol. 3353, pp. 332–343. Springer, Berlin (2004)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Structural properties of graph products;Journal of Graph Theory;2023-08-09
2. Graphs of Linear Growth have Bounded Treewidth;The Electronic Journal of Combinatorics;2023-07-14