Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.03.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966802404 / rank | |||
Normal rank | |||
Revision as of 22:26, 19 March 2024
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
