A characterization of cycle-forced bipartite graphs (Q724892)
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: A characterization of cycle-forced bipartite graphs |
scientific article; zbMATH DE number 6910647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of cycle-forced bipartite graphs |
scientific article; zbMATH DE number 6910647 |
Statements
A characterization of cycle-forced bipartite graphs (English)
0 references
26 July 2018
0 references
bipartite graph
0 references
Hamiltonian graph
0 references
perfect matching
0 references
cycle-forced graph
0 references
0 references
0.8978078
0 references
0.89689505
0 references
0.8892523
0 references
0.8890633
0 references
0.8881635
0 references
