A family of cubical graphs

1947/10/01 by W. T. Tutte · 4 citations
Computer Science · Mathematics · #Topological and Geometric Data Analysis #Digital Image Processing Techniques #Advanced Combinatorial Mathematics #Combinatorics #Mathematics #Computer science

paper · doi:10.1017/s0305004100023720

openalex publication_date 1947/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01

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.

Cited by

• Self-dual configurations and regular graphs
• Configurations from a Graphical Viewpoint
• A census of semisymmetric cubic graphs on up to 768 vertices
• Three utilities problem [wikipedia]