Pages that link to "Item:Q2646809"
From MaRDI portal
The following pages link to The dissection of rectangles into squares (Q2646809):
Displaying 50 items.
- From rubber bands to rational maps: a research report (Q296218) (← links)
- Random infinite squarings of rectangles (Q297439) (← links)
- Decompositions of a polygon into centrally symmetric pieces (Q350249) (← links)
- The triple intersection property, three dimensional extremal length, and tiling of a topological cube (Q428826) (← links)
- `Bureaucratic' set systems, and their role in phylogenetics (Q449344) (← links)
- Boundary value problems on planar graphs and flat surfaces with integer cone singularities. II: The mixed Dirichlet-Neumann problem (Q546122) (← links)
- An enumeration of equilateral triangle dissections (Q608253) (← links)
- On limits of graphs sphere packed in Euclidean space and applications (Q648959) (← links)
- Oded Schramm: from circle packing to SLE (Q651001) (← links)
- Spanning forests and the vector bundle Laplacian (Q651010) (← links)
- Dimers, tilings and trees (Q705883) (← links)
- On filling space with different integer cubes (Q788733) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- Dissecting a brick into bars (Q964201) (← links)
- Resistance distance in wheels and fans (Q981848) (← links)
- A combinatorial proof of the Rayleigh formula for graphs (Q998327) (← links)
- A survey of the asymptotic behaviour of maps (Q1057284) (← links)
- Linear relations in dissections into \(n\)-dimensional parallelepipeds (Q1078813) (← links)
- Knot polynomials and generalized mutation (Q1099443) (← links)
- Rectangular dissections of a square (Q1101117) (← links)
- On the impossibility of packing space with different cubes (Q1116949) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- The full cycles in a Young coset (Q1140654) (← links)
- A paradigm for robust geometric algorithms (Q1185288) (← links)
- Immanants of combinatorial matrices (Q1188158) (← links)
- Packing problems (Q1197916) (← links)
- Determinants and current flows in electric networks (Q1198652) (← links)
- The rotor effect can alter the chromatic polynomial (Q1225063) (← links)
- Resistance bounds for first-passage percolation and maximum flow (Q1284477) (← links)
- Square tilings with prescribed combinatorics (Q1310155) (← links)
- Characterizing tileorders (Q1318356) (← links)
- The dissection of rectangles, cylinders, tori, and Möbius bands into squares (Q1320599) (← links)
- Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the matrix tree theorem (Q1374192) (← links)
- On step-2 transforms for simple perfect squared squares (Q1377727) (← links)
- Graph-polynomials (Q1432994) (← links)
- Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
- Spanning trees on hypercubic lattices and nonorientable surfaces (Q1586302) (← links)
- Binary functions, degeneracy, and alternating dimaps (Q1732786) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- Transportation networks: Old and new (Q1815736) (← links)
- A typology of cutting and packing problems (Q1825761) (← links)
- On the dissection of rectangles into right-angled isosceles triangles (Q1850503) (← links)
- Determinantal probability measures (Q1885395) (← links)
- Dissections into 1:2 rectangles (Q1910542) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- Torus square tilings (Q1928792) (← links)
- Tiling by incongruent equilateral triangles without requiring local finiteness (Q1941565) (← links)
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems (Q2052179) (← links)
- Metric graphs, cross ratios, and Rayleigh's laws (Q2080685) (← links)
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations (Q2136282) (← links)
