Tiled partial cubes
✍ Scribed by Boštjan Brešar; Wilfried Imrich; Sandi Klavžar; Henry Martyn Mulder; Riste Škrekovski
- Book ID
- 102341532
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 130 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In the quest to better understand the connection between median graphs, triangle‐free graphs and partial cubes, a hierarchy of subclasses of partial cubes has been introduced. In this article, we study the role of tiled partial cubes in this scheme. For instance, we prove that almost‐median graphs are tiled and that tiled partial cubes are semi‐median. We also describe median graphs as tiled partial cubes without convex Q and extend an inequality for median graphs to a larger subclass of partial cubes. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 91–103, 2002
📜 SIMILAR VOLUMES
Stein (1990) discovered (n -l)! lattice tilings of R" by translates of the notched n-cube which are inequivalent under translation. We show that there are no other inequivalent tilings of IF!" by translates of the notched cube.
Herb Holden once observed that packing material consisting of copies of a cube of side 2 inches from which a unit corner cube is removed tiles R3 by translates. In [l] Conlan generalized this fact, proving that a polytope obtained from a unit cube in R3 by deleting a corner box of which two dimensio
## Abstract The convex excess __ce__(__G__) of a graph __G__ is introduced as where the summation goes over all convex cycles of __G__. It is proved that for a partial cube __G__ with __n__ vertices, __m__ edges, and isometric dimension __i__(__G__), inequality 2__n__−__m__−__i__(__G__)−__ce__(__G