A characterization of cubic lattice graphs

DOI10.1016/S0021-9800(67)80105-4zbMath0155.32001OpenAlexW1990393147MaRDI QIDQ5538412

Renu C. Laskar

Publication date: 1967

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(67)80105-4

zbMATH Keywords

topology

Related Items (9)

A characterization of the association schemes of bilinear forms ⋮ Two characterizations of interchange graphs of complete m-partite graphs ⋮ Characterization of H(n,q) by the parameters ⋮ Finite nets of dimension three. I ⋮ Partial geometry of dimension three ⋮ A characterization of a class of regular graphs ⋮ A note on the exceptional graph of the cubic lattice graph characterization ⋮ Further characterizations of cubic lattice graphs ⋮ Induced Embeddings into Hamming Graphs.

This page was built for publication: A characterization of cubic lattice graphs