The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs (Q3947135): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 14:38, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs |
scientific article |
Statements
The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs (English)
0 references
1982
0 references
bridge, planted plane tree
0 references
NP-complete
0 references
