The dissection of rectangles into squares
From MaRDI portal
Publication:2646809
Cited in
(95)- A survey of the asymptotic behaviour of maps
- Linear relations in dissections into \(n\)-dimensional parallelepipeds
- Knot polynomials and generalized mutation
- Rectangular dissections of a square
- On the impossibility of packing space with different cubes
- An application of simulated annealing to the cutting stock problem
- The full cycles in a Young coset
- A paradigm for robust geometric algorithms
- Immanants of combinatorial matrices
- Packing problems
- Determinants and current flows in electric networks
- The rotor effect can alter the chromatic polynomial
- Resistance bounds for first-passage percolation and maximum flow
- Square tilings with prescribed combinatorics
- Characterizing tileorders
- The dissection of rectangles, cylinders, tori, and Möbius bands into squares
- Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the matrix tree theorem
- On step-2 transforms for simple perfect squared squares
- Graph-polynomials
- Homogeneous multivariate polynomials with the half-plane property
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Binary functions, degeneracy, and alternating dimaps
- On a 2-dimensional equipartition problem
- Transportation networks: Old and new
- A typology of cutting and packing problems
- On the dissection of rectangles into right-angled isosceles triangles
- Determinantal probability measures
- Dissections into 1:2 rectangles
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
- Torus square tilings
- Tiling by incongruent equilateral triangles without requiring local finiteness
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- Metric graphs, cross ratios, and Rayleigh's laws
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- A deletion-contraction relation for the DP color function
- On the equivalence of cylinder tilings and planar electric networks
- A survey on the cutting and packing problems
- Codichromatic graphs
- Tilings of convex sets by mutually incongruent equilateral triangles contain arbitrarily small tiles
- Tilings of convex polygons by equilateral triangles of many different sizes
- Electrical networks and hyperplane arrangements
- Discrete extremal length and cube tilings in finite dimensions
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Orthogonal trades in complete sets of MOLS
- Tiling by rectangles and alternating current
- A note on ``Reducing the number of binary variables in cutting stock problems
- Dissections of \(p\colon q\) rectangles into 13 \(p\colon q\) rectangular elements
- On existence of compound perfect squared squares of small order
- Alternative configurations for cutting machines in a tube cutting mill
- Invariant coupling of determinantal measures on sofic groups
- Discrete complex analysis on planar quad-graphs
- From rubber bands to rational maps: a research report
- Random infinite squarings of rectangles
- On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
- Negative correlation and log-concavity
- Boundary value problems on planar graphs and flat surfaces with integer cone singularities, I: The Dirichlet problem
- Decompositions of a polygon into centrally symmetric pieces
- From Tessellations to Table Interpretation
- Principal subpermanents of the Laplacian matrix
- Connectivity of finite anisotropic random graphs and directed graphs
- Counting almost minimum cutsets with reliability applications
- Lowest Order Squared Rectangles and Squares With the Largest Element Not on the Boundary
- The triple intersection property, three dimensional extremal length, and tiling of a topological cube
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
- `Bureaucratic' set systems, and their role in phylogenetics
- Decomposition of a cube into nearly equal smaller cubes
- Self-Similar Polygonal Tiling
- A Proof of Tuite’s Trinity Theorem and a New Determinant Formula
- Dissections of 𝑝:𝑞 rectangles
- The number of polyhedral (3-connected planar) graphs
- Generalizing Kirchhoff laws for signed graphs
- On the expansion of combinatorial polytopes
- User recursive functions in maxima
- In the Quest for Invariant Structures Through Graph Theory, Groups and Mechanics: Methodological Aspects in the History of Applied Mathematics
- scientific article; zbMATH DE number 3212974 (Why is no real title available?)
- Boundary value problems on planar graphs and flat surfaces with integer cone singularities. II: The mixed Dirichlet-Neumann problem
- Dissections of trapezoids into trapezoids homothetical to trapezoids in a given family
- Tilings
- Tilings
- Dimer model and holomorphic functions on t‐embeddings of planar graphs
- An enumeration of equilateral triangle dissections
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- On limits of graphs sphere packed in Euclidean space and applications
- Oded Schramm: from circle packing to SLE
- Spanning forests and the vector bundle Laplacian
- Rectangulotopes
- W. T. Tutte -- the graph theorist whose code-busting algorithms powered the D-day invasion
- Scaling limits of planar maps under the Smith embedding
- Convergence of the probabilistic interpretation of modulus
- Dimers, tilings and trees
- On filling space with different integer cubes
- Network flows and non-guillotine cutting patterns
- Dissecting a brick into bars
- Resistance distance in wheels and fans
- A combinatorial proof of the Rayleigh formula for graphs
This page was built for publication: The dissection of rectangles into squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2646809)