On the hardness of finding the geodetic number of a subcubic graph (Q1708262): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.02.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2791124391 / rank | |||
Normal rank | |||
Revision as of 20:28, 19 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
