Suk J. Seo, Peter J. Slater
Published 2022-02-05Version 1
The infinite tumbling block graph is a bipartite graph, where each vertex in one partite set is of degree 3 and each vertex in the other partite set is of degree 6. It is a 2-dimensional array of blocks of seven vertices and nine edges, a planar graph that has 3-D looks. This paper introduces tumbling block graphs and considers various graphical parameters for different classes of infinite and finite tumbling blocks.
Comments: 12 pages, 12 Figures
Journal: Congressus Numerantium 213 (2012), pp. 155-168
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
A note on $\mathtt{V}$-free $2$-matchings
![QR code for arXiv:2202.02620 [math.CO]](http://oss.arxitics.com/images/favicon.svg)