Pages that link to "Item:Q277655"

The following pages link to On the geodetic iteration number of the contour of a graph (Q277655):

Displaying 2 items.

• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
• On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)