A note on shortest cycle covers of cubic graphs (Q2911057)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6081433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on shortest cycle covers of cubic graphs |
scientific article; zbMATH DE number 6081433 |
Statements
A note on shortest cycle covers of cubic graphs (English)
0 references
12 September 2012
0 references
cycle cover
0 references
perfect matching
0 references
2-factor
0 references
shortest cycle cover
0 references
Let \(SCC_3(G)\) be the length of a shortest \(3\)-cycle cover of a bridgeless cubic graph \(G\). The authors prove that \(SCC_3(G) \leq \frac{8}{5}|E(G)|\) if \(G\) contains no circuit of length \(5\). This improves a known result due to \textit{B. Jackson} [``Shortest circuit covers of cubic graphs,'' J. Comb. Theory, Ser. B 60, No. 2, 299--307 (1994; Zbl 0805.05065)].
0 references
0.8909904360771179
0 references
0.8903248310089111
0 references
0.8875051736831665
0 references
0.8805665969848633
0 references
0.8766753077507019
0 references
