Cellular bipartite graphs

被引：19
|
作者：
Bandelt, HJ [1 ]
Chepoi, V [1 ]
机构：
[1] UNIV HAMBURG,MATH SEMINAR,D-20146 HAMBURG,GERMANY
来源：
EUROPEAN JOURNAL OF COMBINATORICS | 1996年 / 17卷 / 2-3期
关键词：
D O I：
10.1006/eujc.1996.0011
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 1996 Academic Press Limited
引用
收藏
页码：121 / 134
页数：14
相关论文
共 50 条
12345