Cubical graphs and cubical dimensions
From MaRDI portal
DOI10.1016/0898-1221(88)90212-XzbMATH Open0645.05066OpenAlexW2094656226MaRDI QIDQ1102987FDOQ1102987
Authors: Frank Harary
Publication date: 1988
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90212-x
Recommendations
Cites Work
Cited In (22)
- Spanning cubic graph designs
- Boolean autoencoders and hypercube clustering complexity
- Orientation spectra of cubic graphs
- On the dimer problem of the vertex-edge graph of a cubic graph
- Distance regular subgraphs of a cube
- Cubic graphs whose average number of regions is small
- An Explicit Construction of Lower-Diameter Cubic Graphs
- Cover-preserving order embeddings into Boolean lattices
- Title not available (Why is that?)
- Partial cubes and crossing graphs
- Title not available (Why is that?)
- A note on the cubical dimension of new classes of binary trees.
- The complexity of cubical graphs
- Generalized sum graphs
- Transformations of cubic graphs
- Induced embeddings into Hamming graphs
- Graphs which are locally a cube
- Cubic bridgeless graphs and braces
- Title not available (Why is that?)
- On semicube graphs
- Permutation-exchange graphs that emulate the binary cube
- Cubic graphs and related triangulations on orientable surfaces
This page was built for publication: Cubical graphs and cubical dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102987)