Optimal packings of edge-disjoint odd cycles (Q1969787)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal packings of edge-disjoint odd cycles |
scientific article; zbMATH DE number 1417403
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal packings of edge-disjoint odd cycles |
scientific article; zbMATH DE number 1417403 |
Statements
Optimal packings of edge-disjoint odd cycles (English)
0 references
19 March 2000
0 references
The purpose of this note is to consider the minimum number of edges which hit all the odd cycles and the maximum number of edge-disjoint odd cycles in a simple graph. It is proved that for the planar graphs, \(\tau_e\) (the edge-transversal number) is bounded by a function of \(\upsilon_e\) (the edge-packing number).
0 references
packings
0 references
odd cycles
0 references
