Hamiltonian spider intersection graphs are cycle extendable (Q5408600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6282659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian spider intersection graphs are cycle extendable |
scientific article; zbMATH DE number 6282659 |
Statements
Hamiltonian Spider Intersection Graphs Are Cycle Extendable (English)
0 references
10 April 2014
0 references
Hamiltonian graphs
0 references
intersection graphs
0 references
cycle extension
0 references
0.8592207431793213
0 references
0.8528922200202942
0 references
0.8513275384902954
0 references
0.8513273000717163
0 references
0.8473187685012817
0 references
