Construction of k-matchings in graph products (Q5058206)
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 7634360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of k-matchings in graph products |
scientific article; zbMATH DE number 7634360 |
Statements
Construction of k-matchings in graph products (English)
0 references
19 December 2022
0 references
maximum matching
0 references
perfect matching
0 references
\(k\)-factor
0 references
graph product
0 references
NP-completeness
0 references
\(k\)-regular subgraphs
0 references
0 references
0 references
0.9001251
0 references
0.8933304
0 references
0 references
0.8910682
0 references
0.8860574
0 references
0.8860501
0 references
0.88058835
0 references
