Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540)
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 5192224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Each maximal planar graph with exactly two separating triangles is Hamiltonian |
scientific article; zbMATH DE number 5192224 |
Statements
Each maximal planar graph with exactly two separating triangles is Hamiltonian (English)
0 references
19 September 2007
0 references
maximal planar graph
0 references
separating triangle
0 references
Hamilton cycle
0 references
0.9426164031028748
0 references
0.913177728652954
0 references
0.8713726997375488
0 references
0.8368731141090393
0 references
