Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle. (Q4568196)
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: Bipartite graphs with every k-matching in a Hamiltonian cycle. |
scientific article; zbMATH DE number 6890352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle. |
scientific article; zbMATH DE number 6890352 |
Statements
15 June 2018
0 references
\(k\)-matching
0 references
\(k\)-matching-Hamiltonian
0 references
Hamiltonian cycle
0 references
bipartite graph
0 references
0.876277506351471
0 references
0.8411843776702881
0 references
0.8232461810112
0 references
0.8232460021972656
0 references
