Covering the edges of a graph by three odd subgraphs

被引:14
|
作者
Matrai, Tamas [1 ]
机构
[1] Eotvos Lorand Univ, Dept Appl Anal, H-1117 Budapest, Hungary
关键词
odd subgraph; edge covering;
D O I
10.1002/jgt.20170
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove that any finite simple graph can be covered by three of its odd subgraphs, and we construct an infinite sequence of graphs where an edge-disjoint covering by three odd subgraphs is not possible. (C) 2006 Wiley Periodicals, Inc.
引用
收藏
页码:75 / 82
页数:8
相关论文
共 50 条