Any maximal planar graph with only one separating triangle is Hamiltonian (Q1411340)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Any maximal planar graph with only one separating triangle is Hamiltonian |
scientific article |
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
