On the hardness of finding the geodetic number of a subcubic graph (Q1708262): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2018.02.012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2018.02.012 / rank | |||
Normal rank | |||
Latest revision as of 05:11, 11 December 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
