A note on covering the edges of a graph with bonds

被引：0
|
作者：
Neumann-Lara, V
Rivera-Campo, E
Urrutia, J
机构：
[1] Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
[2] Univ Ottawa, Ottawa, ON K1N 6N5, Canada
来源：
DISCRETE MATHEMATICS | 1999年 / 197卷 / 1-3期
关键词：
bond; circumference; cover;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For every 2-connected graph G with circumference c there are c bonds B-1, B-2, ... B-c of G such that every edge of G lies in at least two of them. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：633 / 636
页数：4
相关论文
共 50 条
12345