Bipartite graphs with every matching in a cycle (Q878652)
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 5146853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite graphs with every matching in a cycle |
scientific article; zbMATH DE number 5146853 |
Statements
Bipartite graphs with every matching in a cycle (English)
0 references
26 April 2007
0 references
Hamiltonian cycle
0 references
0.8411843776702881
0 references
0.8393750190734863
0 references
0.8304430246353149
0 references
0.8237503170967102
0 references
