Covering the edges of a graph by three odd subgraphs

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. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 77–82, 2006

Saved in:
Bibliographic Details
Published in:Journal of graph theory 2006, Vol.53 (1), p.77-82
Main Author: Mátrai, Tamás
Format: Article
Language:English
Subjects:
edge covering
odd subgraph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 77–82, 2006
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.20170