Hamilton cycles passing through a matching in a bipartite graph with high degree sum (Q6080149)
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 7756956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamilton cycles passing through a matching in a bipartite graph with high degree sum |
scientific article; zbMATH DE number 7756956 |
Statements
Hamilton cycles passing through a matching in a bipartite graph with high degree sum (English)
0 references
30 October 2023
0 references
degree condition
0 references
perfect matching
0 references
bipartite graph
0 references
0.8500127196311951
0 references
0.8386908173561096
0 references
0.8187165856361389
0 references
0.8113948702812195
0 references
