1. Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476–497 (1994)

   Article MathSciNet MATH  Google Scholar 

2. Buchin, K., Schulz, A.: On the Number of Spanning Trees a Planar Graph Can Have. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 110–121. Springer, Heidelberg (2010)

   Chapter  Google Scholar 

3. de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: Bipolar orientations revisited. Discr. Appl. Math. 56(2-3), 157–179 (1995)

   Article MATH  Google Scholar 

4. Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175–198 (1988)

   Article MATH  Google Scholar 

5. Fusy, E., Poulalhon, D., Schaeffer, G.: Bijective counting of plane bipolar orientations. Elec. Notes Discr. Math. 29, 283–287 (2007)

   Article  Google Scholar 

6. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)

   Article MathSciNet MATH  Google Scholar 

7. Graham, R.L., Yao, A.C., Yao, F.F.: Information bounds are weak in the shortest distance problem. J. ACM 27(3), 428–444 (1980)

   Article MathSciNet MATH  Google Scholar 

8. Kahale, N., Schulman, L.J.: Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph. Combinatorica 16(3), 383–397 (1996)

   Article MathSciNet MATH  Google Scholar 

9. Kelly, D.: Fundamentals of planar ordered sets. Disc. Math. 63(2-3), 197–216 (1987)

   Article MATH  Google Scholar 

10. Manber, U., Tompa, M.: The effect of number of hamiltonian paths on the complexity of a vertex-coloring problem. SIAM J. Comput. 13(1), 109–115 (1984)

    Article MathSciNet MATH  Google Scholar 

11. Mehlhorn, K.: Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry, vol. 3. Springer (1984)

    Google Scholar 

Download references