Article ID Journal Published Year Pages File Type
4650778 Discrete Mathematics 2008 7 Pages PDF
Abstract

Chatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–145] have recently conjectured that all bipartite graphs are distance graphs. Here we show that all graphs of a large subclass of bipartite graphs, i.e. partial cubes, are distance graphs.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,