Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. Every map is four colourable;Appel;Bull. Amer. Math. Soc.,1976
2. The book thickness of a graph;Bernhart;J. Combin. Theory Ser. B,1979
3. J.F. Buss, P.W. Shor, On the pagenumber of planar graphs, in: Proc. the 16th Annual ACM Symp. Theory of Computing, STOC, 1984, pp. 98–100.
4. Embedding graphs in books: a layout problem with application to VLSI design;Chung;SIAM J. Algebr. Discrete Methods,1987
5. Graph treewidth and geometric thickness parameters;Dujmović;Discrete Comput. Geom.,2007
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A survey on book-embedding of planar graphs;Frontiers of Mathematics in China;2022-04