Pages that link to "Item:Q2695276"

From MaRDI portal

← On the approximation hardness of geodetic set and its variants (Q2695276)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to On the approximation hardness of geodetic set and its variants (Q2695276):

Displaying 3 items.

Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)
On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q2695276"