On dispersable book embeddings

[1]  David R. Wood,et al.  Graph drawings with few slopes , 2007, Comput. Geom..

[2]  Mihalis Yannakais,et al.  Embedding planar graphs in four pages , 1989, STOC 1989.

[3]  Peter W. Shor,et al.  On the pagenumber of planar graphs , 1984, STOC '84.

[4]  I. Z. Bouwer.  On edge but not vertex transitive regular graphs , 1972 .

[5]  David R. Wood,et al.  Graph Treewidth and Geometric Thickness Parameters , 2005, GD.

[6]  Pat Morin,et al.  Distinct Distances in Graph Drawings , 2008, Electron. J. Comb..

[7]  Michael A. Bekos,et al.  Two-Page Book Embeddings of 4-Planar Graphs , 2014, Algorithmica.

[8]  David R. Wood,et al.  On Linear Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..

[9]  J. Folkman.  Regular line-symmetric graphs , 1967 .

[10]  David R. Wood.  Bounded-Degree Graphs have Arbitrarily Large Queue-Number , 2008, Discret. Math. Theor. Comput. Sci..

[11]  R. Steinberg.  The State of the Three Color Problem , 1993 .

[12]  Seth M. Malitz,et al.  Genus g Graphs Have Pagenumber O(sqrt(g)) , 1994, J. Algorithms.

[13]  Gary Chartrand,et al.  On Uniquely Colorable Planar Graphs , 1969 .

[14]  Paul C. Kainen,et al.  Extension of a theorem of Whitney , 2007, Appl. Math. Lett..

[15]  R. Balakrishnan,et al.  A textbook of graph theory , 1999 .

[16]  Arnold L. Rosenberg,et al.  Comparing Queues and Stacks as Mechanisms for Laying out Graphs , 1992, SIAM J. Discret. Math..

[17]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[18]  Michael A. Bekos,et al.  The Book Embedding Problem from a SAT-Solving Perspective , 2015, Graph Drawing.

[19]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[20]  Jirí Matousek,et al.  Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness , 2006, Electron. J. Comb..

[21]  János Pach,et al.  Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers , 2006, Electron. J. Comb..

[22]  Seth M. Malitz,et al.  Graphs with E Edges Have Pagenumber O(sqrt(E)) , 1994, J. Algorithms.

[23]  Patrice Ossona de Mendez,et al.  A left-first search algorithm for planar graphs , 1995, Discret. Comput. Geom..

[24]  Arnold L. Rosenberg,et al.  Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[25]  Robert E. Tarjan,et al.  Sorting Using Networks of Queues and Stacks , 1972, J. ACM.

[26]  Gérard Cornuéjols,et al.  Halin graphs and the travelling salesman problem , 1983, Math. Program..

[27]  Lenwood S. Heath.  Embedding Planar Graphs in Seven Pages , 1984, FOCS.

[28]  Arnold L. Rosenberg,et al.  The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.