Any maximal planar graph with only one separating triangle is Hamiltonian (Q1411340)
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 1997341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Any maximal planar graph with only one separating triangle is Hamiltonian |
scientific article; zbMATH DE number 1997341 |
Statements
Any maximal planar graph with only one separating triangle is Hamiltonian (English)
0 references
27 October 2003
0 references
planar graph
0 references
maximal planar graph
0 references
hamiltonian cycle
0 references
separating triangle
0 references
NP-complete
0 references
0.9629763
0 references
0.8643558
0 references
0.8591764
0 references
0.85886794
0 references
0.8524941
0 references
0 references
0.8483836
0 references
