A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian (Q2864339)
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 necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian |
scientific article; zbMATH DE number 6236297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian |
scientific article; zbMATH DE number 6236297 |
Statements
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian (English)
0 references
6 December 2013
0 references
0.8079162836074829
0 references
0.8060933351516724
0 references
0.7989351749420166
0 references
