On the hardness of finding the geodetic number of a subcubic graph (Q1708262)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of finding the geodetic number of a subcubic graph |
scientific article |
Statements
On the hardness of finding the geodetic number of a subcubic graph (English)
0 references
5 April 2018
0 references
geodetic number
0 references
geodetic set
0 references
geodetic convexity
0 references
computational complexity
0 references
maximum degree three
0 references
