On the Number of alpha -Orientations
暂无分享,去创建一个
[1] R. J. Baxter,et al. F Model on a Triangular Lattice , 1969 .
[2] Dominique Poulalhon,et al. Optimal Coding and Sampling of Triangulations , 2003, ICALP.
[3] Stefan Felsner,et al. Geometric Graphs and Arrangements , 2004 .
[4] H. Temperley,et al. Combinatorics: Enumeration of graphs on a large periodic lattice , 1974 .
[5] Ares Ribó Mor. Realization and counting problems for planar structures , 2006 .
[6] Elliott H. Lieb,et al. Residual Entropy of Square Ice , 1967 .
[7] Paul S. Bonsma. Spanning Trees with Many Leaves in Graphs With Minimum Degree Three , 2008, SIAM J. Discret. Math..
[8] David Bruce Wilson,et al. Trees and Matchings , 2000, Electron. J. Comb..
[9] Éric Fusy,et al. Dissections and trees, with applications to optimal mesh encoding and to random sampling , 2005, SODA '05.
[10] Michael Luby,et al. Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..
[11] H. de Fraysseix,et al. On topological aspects of orientations , 2001, Discret. Math..
[12] Herbert S. Wilf,et al. The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..
[13] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[14] Stefan Felsner,et al. Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.
[15] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.
[16] W. Schnyder. Planar graphs and poset dimension , 1989 .
[17] Nicolas Bonichon,et al. A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths , 2005, Discret. Math..
[18] Patrice Ossona de Mendez,et al. Bipolar orientations Revisited , 1995, Discret. Appl. Math..
[19] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.
[20] Pierre Rosenstiehl. Embedding in the Plane With Orientation Constraints: The Angle Graph , 1989 .
[21] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..
[22] W. T. Tutte,et al. A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.
[23] Stefan Felsner,et al. Lattice Structures from Planar Graphs , 2004, Electron. J. Comb..
[24] W. T. Tutte. A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.
[25] Robin Thomas,et al. PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.
[26] C. Little. A characterization of convertible (0, 1)-matrices , 1975 .
[27] D. R. Woods. Drawing planar graphs , 1981 .
[28] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[29] Stefan Felsner,et al. Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.
[30] Paul Bonsma,et al. Sparse cuts, matching-cuts and leafy trees in graphs , 2006 .
[31] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.
[32] R. Baxter. Exactly solved models in statistical mechanics , 1982 .