The isogonal sponges on the cubic lattice.
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Vertex- and edge-truncation of the Platonic and Archimedean solids leading to vertex-transitive polyhedra”
The isogonal sponges on the cubic lattice.
Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
A census of vertices by generations in regular tessellations of the plane.
Paul, Alice, Pippenger, Nicholas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Infinite directed paths in locally finite digraphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
A lower bound for the packing chromatic number of the Cartesian product of cycles
Yolandé Jacobs, Elizabeth Jonck, Ernst Joubert (2013)
Open Mathematics
Similarity:
Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X i ⊆ V(G) is called an i-packing if each two distinct vertices in X i are more than i apart. A packing colouring of G is a partition X = {X 1, X 2, …, X k} of V(G) such that each colour class X i is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χρ(G). In this paper we show, using a theoretical proof, that if q = 4t, for some integer t...