The following pages link to A characterization of hypercubes (Q1236550):
Displaying 18 items.
- Interval-regularity does not lead to interval monotonicity (Q685568) (← links)
- \((0,\lambda)\)-graphs and \(n\)-cubes (Q755594) (← links)
- A q-analogous of the characterization of hypercubes as graphs (Q762493) (← links)
- Interval-regular graphs (Q795060) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- On the complexity of testing a graph for n-cube (Q1146982) (← links)
- Another characterization of hypercubes (Q1162520) (← links)
- A graph theoretic approach to switching function minimization (Q1168952) (← links)
- On the properties of arbitrary hypercubes (Q1173100) (← links)
- Two characterizations of generalized hypercube (Q1182875) (← links)
- Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes (Q1356432) (← links)
- Optimal gray-code labeling and recognition algorithms for hypercubes (Q1602516) (← links)
- On \(F\)-geodetic graphs (Q1813987) (← links)
- A characterization of cube-hypergraphs (Q1917484) (← links)
- Betweenness centrality in some classes of graphs (Q2019271) (← links)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
- On super connectivity of Cartesian product graphs (Q3528152) (← links)
- Rigidity properties of the hypercube via Bakry-Émery curvature (Q6191268) (← links)
