Binding number, minimum degree and bipancyclism in bipartite graphs (Q5282775)
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: Binding number, minimum degree and bipancyclism in bipartite graphs |
scientific article; zbMATH DE number 6747426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binding number, minimum degree and bipancyclism in bipartite graphs |
scientific article; zbMATH DE number 6747426 |
Statements
Binding number, minimum degree and bipancyclism in bipartite graphs (English)
0 references
14 July 2017
0 references
balanced bipartite graph
0 references
Hamiltonian graph
0 references
bipancyclism
0 references
bipartite binding number
0 references
minimum degree
0 references
0.9307901263237
0 references
0.8411373496055603
0 references
0.8391969799995422
0 references
0.8261826038360596
0 references
