Abstract

AbstractIn 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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call