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
机构:
Univ KwaZulu Natal, Sch Math Stat & Informat Technol, ZA-3209 Pietermaritzburg, South AfricaUniv KwaZulu Natal, Sch Math Stat & Informat Technol, ZA-3209 Pietermaritzburg, South Africa
Henning, Michael A.
Rautenbach, Dieter
论文数: 0引用数: 0
h-index: 0
机构:Univ KwaZulu Natal, Sch Math Stat & Informat Technol, ZA-3209 Pietermaritzburg, South Africa
机构:
Department of Mathematics and Industrial Engineering, Polytechnique Montreal, MontrealDepartment of Mathematics and Industrial Engineering, Polytechnique Montreal, Montreal