Pages that link to "Item:Q2747184"
From MaRDI portal
The following pages link to The isometric path number of a graph (Q2747184):
Displaying 12 items.
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- Isometric-path numbers of block graphs (Q835002) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- On the isometric path partition problem (Q2042617) (← links)
- Isometric path numbers of graphs (Q2501546) (← links)
- Strong geodetic problem on Cartesian products of graphs (Q4579894) (← links)
- Distance-based covering problems for graphs of given cyclomatic number (Q6546588) (← links)
- On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture (Q6606329) (← links)
- Parameterizing path partitions (Q6664058) (← links)