Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids
From MaRDI portal
Publication:3390423
zbMath1487.51009arXiv2009.07918MaRDI QIDQ3390423
S. R. Shannon, L. Blomberg, N. J. A. Sloane
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2009.07918
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Elementary problems in Euclidean geometries (51M04)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of deciphering the threshold functions of \(k\)-valued logic
- The On-Line Encyclopedia of Integer Sequences
- On the Number of Two-Dimensional Threshold Functions
- On the Minimal Teaching Sets of Two-Dimensional Threshold Functions
- The Historical Development of J. J. Sylvester's Four Point Problem
- Primitive Juggling Sequences
- The Number of Regions Determined by a Convex Polygon
- GFUN
- The Number of Intersection Points Made by the Diagonals of a Regular Polygon
- On the enumeration of planar maps
- A Census of Planar Maps
This page was built for publication: Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids