arXiv Analytics

Sign in

arXiv:1901.06571 [math.CO]AbstractReferencesReviewsResources

Partial cubes with pre-hull number at most 1

Norbert Polat

Published 2019-01-19Version 1

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.

Comments: 15 pages, 1 figure
Categories: math.CO
Subjects: 05C75, 52A37
Related articles: Most relevant | Search more
arXiv:1703.05861 [math.CO] (Published 2017-03-17)
An Improved Bound for Upper Domination of Cartesian Products of Graphs
arXiv:2107.11741 [math.CO] (Published 2021-07-25)
Cops and Robber on Cartesian products and some classes of hypergraphs
arXiv:1709.04189 [math.CO] (Published 2017-09-13)
The Graovac-Pisanski index of a connected bipartite graph is an integer number