A note on interconnecting matchings in graphs (Q2509302)
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 5065173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on interconnecting matchings in graphs |
scientific article; zbMATH DE number 5065173 |
Statements
A note on interconnecting matchings in graphs (English)
0 references
19 October 2006
0 references
toughness
0 references
2-walk
0 references
matroid intersection
0 references
0.9197922
0 references
0.9112902
0 references
0.90788794
0 references
0.9054761
0 references
0.89924383
0 references
