Title of article
Cellular Bipartite Graphs
Author/Authors
Hans-Jürgen Bandelt، نويسنده , , Hans-Jürgen and Chepoi، نويسنده , , Victor، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
14
From page
121
To page
134
Abstract
In this paper we investigate the graphs that are obtained from single edges and even cycles by successive gated amalgamations. These ‘cellular’ graphs are characterized among bipartite graphs by having a totally decomposable shortest-path metric, and can be recognized by a quadratic time algorithm.
Journal title
European Journal of Combinatorics
Serial Year
1996
Journal title
European Journal of Combinatorics
Record number
1556408
Link To Document