The following pages link to On cubical graphs (Q1215634):
Displaying 20 items.
- Representation of finite graphs as difference graphs of \(S\)-units. I (Q406579) (← links)
- Distance regular subgraphs of a cube (Q686314) (← links)
- Hypercube embedding heuristics: An evaluation (Q916339) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- Cubical graphs and cubical dimensions (Q1102987) (← links)
- Isometric embeddings in Hamming graphs (Q1110526) (← links)
- On the complexity of testing a graph for n-cube (Q1146982) (← links)
- Cover-preserving order embeddings into Boolean lattices (Q1207716) (← links)
- A characterization of hypercubes (Q1236550) (← links)
- The number of edges in a subgraph of a Hamming graph (Q1600356) (← links)
- Optimal gray-code labeling and recognition algorithms for hypercubes (Q1602516) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- Subgraphs of hypercubes and subdiagrams of Boolean lattices (Q1815849) (← links)
- On subgraphs of Cartesian product graphs and S-primeness (Q1827726) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Topes of oriented matroids and related structures (Q2368174) (← links)
- Recognizing binary Hamming graphs inO(n 2 logn) time (Q4850329) (← links)
- Packing the hypercube (Q5405279) (← links)
- Functionality of box intersection graphs (Q6140059) (← links)
- Resonance graphs on perfect matchings of graphs on surfaces (Q6172208) (← links)
