Pages that link to "Item:Q1146982"
From MaRDI portal
The following pages link to On the complexity of testing a graph for n-cube (Q1146982):
Displaying 6 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Hypercube embedding heuristics: An evaluation (Q916339) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- A graph theoretic approach to switching function minimization (Q1168952) (← links)
- Recognizing halved cubes in a constant time per edge (Q1902967) (← links)
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)