Supereulerian graphs with constraints on the matching number and minimum degree (Q2657064)
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 7324261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Supereulerian graphs with constraints on the matching number and minimum degree |
scientific article; zbMATH DE number 7324261 |
Statements
Supereulerian graphs with constraints on the matching number and minimum degree (English)
0 references
17 March 2021
0 references
supereulerian graph
0 references
Hamiltonian line graph
0 references
matching
0 references
minimum degree
0 references
contraction
0 references
0.921910285949707
0 references
0.9044011831283568
0 references
0.8558769226074219
0 references
0.854943573474884
0 references
0.8541774153709412
0 references
