A note about shortest cycle covers (Q2581631): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q218263 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Chunhui Lai / rank | |||
Normal rank | |||
Revision as of 09:17, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note about shortest cycle covers |
scientific article |
Statements
A note about shortest cycle covers (English)
0 references
10 January 2006
0 references
The authors prove the following result: Let \(G\) be a graph with odd edge-connectivity \(r\). If \(r>3\), then \(G\) has a 3-cycle \((1,2)\)-cover of total length at most \((r+1)| E(G)|/r\).
0 references
odd-edge connectivity
0 references
