The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs (Q3947135): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Dominique Gouyou-Beauchamps / rank | |||
| Property / author | |||
| Property / author: Dominique Gouyou-Beauchamps / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0211042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975729263 / rank | |||
Normal rank | |||
Latest revision as of 15:30, 19 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
