Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Each maximal planar graph with exactly two separating triangles is Hamiltonian |
scientific article |
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
