28 search results - page 1 / 6 » A characterization of halved cubes |
ARSCOM
1998
13 years 5 months ago
1998
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
DM
2008
13 years 5 months ago
2008
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
DOLAP
1999
ACM
13 years 9 months ago
1999
ACM
Recently numerous proposals for modelling and querying Multidimensional Databases (MDDB) are proposed. Among the still open problems there is a rigorous classification of the diff...
DAM
1999
13 years 5 months ago
1999
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...