The following pages link to The geodetic number of a graph (Q1310238):
Displaying 50 items.
- The forcing vertex detour monophonic number of a graph (Q322058) (← links)
- Upper detour monophonic number of a graph (Q327673) (← links)
- A cut locus for finite graphs and the farthest point mapping (Q501076) (← links)
- On the geodetic and the hull numbers in strong product graphs (Q630693) (← links)
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- On the geodetic number of permutation graphs (Q741406) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- On the geodetic number and related metric sets in Cartesian product graphs (Q998436) (← links)
- The \((a,b)\)-forcing geodetic graphs (Q1024478) (← links)
- The hull and geodetic numbers of orientations of graphs (Q1025467) (← links)
- The upper connected geodetic number and forcing connected geodetic number of a graph (Q1028129) (← links)
- The forcing hull and forcing geodetic numbers of graphs (Q1028447) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Toll number of the strong product of graphs (Q1712528) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Toll number of the Cartesian and the lexicographic product of graphs (Q2012538) (← links)
- The outer connected geodetic number of a graph (Q2057495) (← links)
- Algorithmic upper bounds for graph geodetic number (Q2103929) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- A general framework for path convexities (Q2156285) (← links)
- On the toll number of a graph (Q2172405) (← links)
- Strong edge geodetic problem on grids (Q2239003) (← links)
- Products of geodesic graphs and the geodetic number of products (Q2259562) (← links)
- The geodetic number of the lexicographic product of graphs (Q2275393) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- The connected vertex detour monophonic number of a graph (Q2361515) (← links)
- The strong convexity spectra of grids (Q2409510) (← links)
- Strong edge geodetic problem in networks (Q2409583) (← links)
- The lower and upper forcing geodetic numbers of block--cactus graphs (Q2432848) (← links)
- The connected monophonic number of a graph (Q2441356) (← links)
- On pitfalls in computing the geodetic number of a graph (Q2463833) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Comment on "Edge Geodetic Covers in Graphs (Q2812611) (← links)
- THE LINEAR GEODETIC NUMBER OF A GRAPH (Q2890992) (← links)
- The lower and upper forcing geodetic numbers of complete<i>n</i>-partite graphs,<i>n</i>-dimensional meshes and tori (Q3056403) (← links)
- EXTREME STEINER GRAPHS (Q3166734) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- On the (M, D) number of a graph (Q3294993) (← links)
- Upper double monophonic number of a graph (Q3295208) (← links)
- Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
- On The Edge Geodetic Number Of A Graph (Q4449518) (← links)
- Strong geodetic problem on Cartesian products of graphs (Q4579894) (← links)
- Extreme Geodesic Graphs (Q4800005) (← links)
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
