A note about shortest cycle covers (Q2581631): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.06.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2129350639 / rank | |||
Normal rank | |||
Revision as of 03:11, 20 March 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
