An upper bound on the length of a Hamiltonian walk of a maximal planar graph (Q3870928): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.3190040310 / rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian circuits on 3-polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simple paths on polyhedra / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.3190040310 / rank | |||
Normal rank | |||
Latest revision as of 00:11, 22 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the length of a Hamiltonian walk of a maximal planar graph |
scientific article |
Statements
An upper bound on the length of a Hamiltonian walk of a maximal planar graph (English)
0 references
1980
0 references
upper bound
0 references
length of a Hamiltonian walk
0 references
maximal planar graph
0 references
Hamiltonian cycle
0 references
traveling salesman problem
0 references
