The following pages link to (Q3663348):
Displaying 18 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- The theory and practice of distance geometry (Q594021) (← links)
- Space graphs and sphericity (Q595671) (← links)
- The coordinate representation of a graph and \(n\)-universal graph of radius 1 (Q687112) (← links)
- On the sphericity and cubicity of graphs (Q789416) (← links)
- On the sphericity for the join of many graphs (Q796544) (← links)
- On the sphericity of the graphs of semiregular polyhedra (Q1076032) (← links)
- Sphericity exceeds cubicity for almost all complete bipartite graphs (Q1077426) (← links)
- Intersection graphs for families of balls in \(R^n\) (Q1112070) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
- Calculating the Hausdorff dimension of tree structures (Q1279324) (← links)
- Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs (Q1313863) (← links)
- Unit disk graph recognition is NP-hard (Q1384186) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- A digraph represented by a family of boxes or spheres (Q3344012) (← links)
- The frame dimension and the complete overlap dimension of a graph (Q3705491) (← links)
