On the number of alternating paths in bipartite complete graphs (Q2014212)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of alternating paths in bipartite complete graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of alternating paths in bipartite complete graphs |
scientific article |
Statements
On the number of alternating paths in bipartite complete graphs (English)
0 references
10 August 2017
0 references
alternating paths
0 references
Hamming distance
0 references
random colorings
0 references
integer programs
0 references
alternating connectivity
0 references
0.9261294
0 references
0.9222043
0 references
0.9103496
0 references
0.9065216
0 references
0.88827074
0 references
0.8875917
0 references
0.8832293
0 references
