


















We prove that a connected bipartite graph G is a partial cube if and only if the set of attaching points of any copoint of G is convex. A consequence of this result is that any connected bipartite graph with pre-hull number at most 1 is a partial cube. We show that the class of partial cubes with pre-hull number at most 1 is closed under gated subgraphs, gated amalgams and cartesian products.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。