Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443)
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: Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs |
scientific article; zbMATH DE number 6759332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs |
scientific article; zbMATH DE number 6759332 |
Statements
Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (English)
0 references
10 August 2017
0 references
cycles
0 references
packing
0 references
covering
0 references
0.99999976
0 references
0.9436263
0 references
0.93261164
0 references
0 references
0.8872588
0 references
0.87998086
0 references
0.87350994
0 references
0.8708073
0 references
0.8705198
0 references
0.87031364
0 references
