Abstract
We begin with some definitions.A cubical graph is a simplicial 1-complex in which each 0-simplex is incident with just three 1-simplexes.

This publication has 1 reference indexed in Scilit: