Author:
Bekos Michael A.,Gronemann Martin,Raftopoulou Chrysanthi N.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference14 articles.
1. Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory 27(3), 320–331 (1979)
2. Chen, C.: Any maximal planar graph with only one separating triangle is hamiltonian. J. Comb. Optim. 7(1), 79–86 (2003)
3. Chiba, N., Nishizeki, T.: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. J. Algorithms 10(2), 187–211 (1989)
4. Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebr. Discret. Methods 8(1), 33–58 (1987)
5. Dujmovic, V., Wood, D.R.: On linear layouts of graphs. Discret. Math. Theor. Comput. Sci. 6(2), 339–358 (2004)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献