Partial cubes and their \(\tau\)-graphs (Q875040)

A partial cube graph is an isometric subgraph of a hypercube. On such graphs the Djoković-Winkler relation is an equivalence. The equivalence classes form the \(\tau\)-graph with edges corresponding to convex 3-node paths. It is shown that any graph is the \(\tau\)-graph of some median graph. The \(\tau\)-graph is connected only for Cartesian prime graphs. For a median graph it is \(K_n\)-free if and only if the original contains no convex star.