Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cartesian products of block graphs

Cartesian products of block graphs Hamming graphs (being the Cartesian products of complete graphs) are known to be the quasi-median graphs not containing the 3-vertex path as a convex subgraph. Similarly, the Cartesian products of trees have been characterized among median graphs by a single forbidden convex subgraph. In this note a common generalization of these two results is given that characterizes the Cartesian products of block graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg Springer Journals

Cartesian products of block graphs

Download PDF
5 pages

Loading next page...
 
/lp/springer-journals/cartesian-products-of-block-graphs-I0zHVZf5LT

References (9)

Publisher
Springer Journals
Copyright
Copyright
Subject
Mathematics; Mathematics, general; Algebra; Differential Geometry; Number Theory; Topology; Geometry
ISSN
0025-5858
eISSN
1865-8784
DOI
10.1007/BF02953314
Publisher site
See Article on Publisher Site

Abstract

Hamming graphs (being the Cartesian products of complete graphs) are known to be the quasi-median graphs not containing the 3-vertex path as a convex subgraph. Similarly, the Cartesian products of trees have been characterized among median graphs by a single forbidden convex subgraph. In this note a common generalization of these two results is given that characterizes the Cartesian products of block graphs.

Journal

Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg – Springer Journals

Published: Sep 11, 2008

There are no references for this article.