Packing $k$-Matchings and $k$-Critical Graphs (Q4602858)
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 6835626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing $k$-Matchings and $k$-Critical Graphs |
scientific article; zbMATH DE number 6835626 |
Statements
Packing $k$-Matchings and $k$-Critical Graphs (English)
0 references
7 February 2018
0 references
matching
0 references
packing
0 references
polynomial algorithm
0 references
critical graph
0 references
0 references
0 references
0.91651964
0 references
0.91645426
0 references
0 references
0 references
0.91238207
0 references
0.9123201
0 references
0 references
0.9085269
0 references
