On the hardness of finding the geodetic number of a subcubic graph (Q1708262): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:23, 5 March 2024
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
