On the number of planar orientations with prescribed degrees

Electronic Journal of Combinatorics

Volumn 15, Issue 1, 2008, Pages

  Felsner, Stefan ^a   Zickfeld, Florian ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 45749098256     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/801     Document Type: Article

References (40)

1. R. J. BAXTER, F model on a triangular lattice, J. Math. Physics, 10 (1969), pp. 1211-1216.
2. R. J. BAXTER, Exactly solved models in statistical mechanics, Academic Press, 1982.
3. N. BONICHON, A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths, Discrete Mathematics, 298 (2005), pp. 104-114. FPSAC'02 Special Issue.
4. N. BONICHON, S. FELSNER, AND M. MOSBAH, Convex drawings of 3-connected planar graphs, in Graph Drawing (Proc. GD '04), vol. 3383 of LNCS, 2004, pp. 60-70.
5. P. S. BONSMA, Spanning trees with many leaves in graphs with minimum degree three. Submitted to SIAM Journal on Discrete Mathematics.
6. P. S. BONSMA, Sparse Cuts, Matching-Cuts and Leafy Trees in Graphs, PhD thesis, University of Twente, 2006.
7. N. J. CALKIN AND H. S. WILF, The number of independent sets in a grid graph, SIAM J. Discrete Math., 11 (1998), pp. 54-60.
8. P. CREED, Counting Eulerian orientations is planar graphs is #P-complete. Personal Communication, 2007.
9. P. DAGUM AND M. LUBY, Approximating the permanent of graphs with large factors, Theoretical Computer Science, 102 (1992), pp. 283-305.
10. H. DE FRAYSSEIX AND P. O. DE MENDEZ, On topological aspects of orientation, Discrete Math., 229 (2001), pp. 57-72.
11. H. DE FRAYSSEIX, P. O. DE MENDEZ, AND P. ROSENSTIEHL, Bipolar orientations revisited, Discrete Appl. Math., 56 (1995), pp. 157-179.
12. S. FELSNER, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order, 18 (2001), pp. 19-37.
13. S. FELSNER, Geometric Graphs and Arrangements, Vieweg Verlag, 2004.
14. S. FELSNER, Lattice structures from planar graphs, Elec. J. Comb., (2004). R15.
15. S. FELSNER, É. FUSY, M. NOY, D. ORDEN, D. POULALHON, AND G. SCHAEFFER, Baxter families and more: Bijections and counting, 2007. in preparation.
16. S. FELSNER, C. HUEMER, S. KAPPES, AND D. ORDEN, Binary labelings for plane quadrangulations and their relatives. preprint 2007.
17. É. FUSY, Transversal structures on triangulations, with application to straight-line drawing., in Graph Drawing(Proc. GD '05), 2005, pp. 177-188.
18. É. FUSY, Combinatorics of Plane Maps with Algorithmic Applications, PhD thesis, École Polytechnique, 2007.
19. É. FUSY, D. POULALHON, AND G. SCHAEFFER, Dissections and trees, with applications to optimal mesh encoding and to random sampling, in SODA, 2005, pp. 690-699.
20. M. JERRUM, A. SINCLAIR, AND E. VIGODA, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, JACM, 51 (2004), pp. 671-697.
21. R. W. KENYON, J. G. PROPP, AND D. B. WILSON, Trees and matchings, Elec. J. Comb., 7 (2000).
22. E. H. LIEB, The residual entropy of square ice, Physical Review, 162 (1967), pp. 162-172.
23. C. H. C. LITTLE, A characterization of convertible (0; 1)-matrices, J. Combin. Theory Ser. B, 18 (1975), pp. 187-208.
24. L. LOVÁSZ AND M. D. PLUMMER, Matching Theory, no. 29 in Annals of Discrete Mathematics, North-Holland, 1986.
25. S. MELANG, Bipolare Orientierungen planarer Graphen, master's thesis, Technische Universität Berlin, 2006.
26. M. MIHAIL AND P. WINKLER, On the nubmer of Eulerian orienations of a graph, Algorithmica, 16 (1996), pp. 402-424.
27. D. POULALHON AND G. SCHAEFFER, Optimal coding and sampling of triangulations, in Proceedings of ICALP'03, vol. 2719 of LNCS, Springer, 2003, pp. 1080-1094.
28. A. RIBÓ, Realization and Counting Problems for Planar Structures: Trees and Linkages, Polytopes and Polyominoes, PhD thesis, Freie Unversität Berlin, 2006.
29. N. ROBERTSON, P. D. SEYMOUR, AND R. THOMAS, Permanents, Pfaffian orientations, and even directed circuits, Ann. of Math., 150 (1999), pp. 929-975.
30. P. ROSENSTIEHL, Embedding in the plane with orientation constraints: the angle graph, Ann. New York Acad. Sci., (1983), pp. 340-346.
31. G. ROTE, The number of spanning trees in a planar graph, in Oberwolfach Reports, vol. 2, EMS, 2005, pp. 969-973. http://page.mi.fu- berlin.de/rote/about_me/publications.html.
32. W. SCHNYDER, Planar graphs and poset dimension, Order, 5 (1989), pp. 323-343.
33. W. SCHNYDER, Embedding planar graphs on the grid, Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 5 (1990), pp. 138-148.
34. N. J. A. SLOANE, The on-line encyclopedia of integer sequences. http://www.research.att.com/~njas/sequences.
35. R. TAMASSIA AND I. G. TOLLIS, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom., 1 (1986), pp. 321-341.
36. H. N. V. TEMPERLEY, Enumeration of graphs on a large periodic lattice, in Combinatorics: Proceedings of the British Combinatorial Conference 1973, London Mathematical Society Lecture Note Series #13, 1974, pp. 155-159.
37. W. T. TUTTE, A short proof of the factor theorem for finite graphs, Canadian Journal of Mathematics, 6 (1954), pp. 347-352.
38. W. T. TUTTE, A census of planar triangulations, Canadian Journal of Mathematics, 14 (1962), pp. 138-148.
39. S. P. VADHAN, The complexity of counting in sparse, regular, and planar graphs, SIAM Journal of Computing, 31 (2001), pp. 398-427.
40. D. R. WOODS, Drawing Planar Graphs, PhD thesis, Stanford University, 1982. Technical Report STAN-CS-82-943.