On the Number of Spanning Trees a Planar Graph Can Have
暂无分享,去创建一个
[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[2] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[3] Ares Ribó Mor. Realization and counting problems for planar structures , 2006 .
[4] Gnter Rote,et al. The number of spanning trees in a planar graph , 2005 .
[5] W. T. Tutte. Convex Representations of Graphs , 1960 .
[6] Brendan D. McKay,et al. Spanning Trees in Regular Graphs , 1983, Eur. J. Comb..
[7] Ares Rib. Embedding 3-Polytopes on a Small Grid , 2007 .
[8] Raimund Seidel,et al. On the Number of Cycles in Planar Graphs , 2007, COCOON.
[9] Micha Sharir,et al. Counting Triangulations of Planar Point Sets , 2009, Electron. J. Comb..
[10] Roland Bacher,et al. The lattice of integral flows and the lattice of integral cuts on a finite graph , 1997 .
[11] Günter Rote,et al. Embedding 3-polytopes on a small grid , 2007, SCG '07.
[12] N. Biggs. Algebraic Potential Theory on Graphs , 1997 .
[13] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[14] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[15] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[16] W. T. Tutte. How to Draw a Graph , 1963 .
[17] Stephen Suen,et al. A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph , 1990, Random Struct. Algorithms.
[18] H. Hahn. Encyklopädie der mathematischen Wissenschaften , 1928 .
[19] Russell Lyons. Asymptotic Enumeration of Spanning Trees , 2005, Comb. Probab. Comput..
[20] P. W. Kasteleyn. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .
[21] Norman Biggs,et al. Chip-Firing and the Critical Group of a Graph , 1999 .
[22] Jürgen Richter-Gebert. Realization Spaces of Polytopes , 1996 .
[23] Erik D. Demaine,et al. Enumerating Foldings and Unfoldings Between Polygons and Polytopes , 2002, Graphs Comb..
[24] H. Whitney. A Set of Topological Invariants for Graphs , 1933 .
[25] M. Fisher,et al. Dimer problem in statistical mechanics-an exact result , 1961 .
[26] Russell Merris,et al. A bound for the complexity of a simple graph , 1988, Discret. Math..
[27] Ferran Hurtado,et al. On the number of plane graphs , 2006, SODA '06.
[28] W. Marsden. I and J , 2012 .
[29] Ferran Hurtado,et al. On the Number of Plane Geometric Graphs , 2007, Graphs Comb..