The isometric path number of a graph

MaRDI QIDQ2747184zbMATH OpenFDO

Authors David C. Fisher, S. L. Fitzpatrick

Publication date 21 January 2002

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

Cartesian productcoverisometricpath

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Isometric path numbers of graphs
• The ultimate isometric path number of a graph
• scientific article; zbMATH DE number 1439423
• Isometric-path numbers of block graphs
• Publication:4489249

Cited in

(18)

• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong geodetic number of graphs and connectivity
• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
• On the isometric path partition problem
• Isometric path numbers of graphs
• The ultimate isometric path number of a graph
• Strong geodetic problem on Cartesian products of graphs
• scientific article; zbMATH DE number 1439423 (Why is no real title available?)
• Fractional isometric path number
• Covering hypercubes by isometric paths
• Distance-based covering problems for graphs of given cyclomatic number
• On graphs coverable by \({k}\) shortest paths
• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• Parameterizing path partitions
• The geodesic cover problem for butterfly networks
• Distance-based (and path-based) covering problems for graphs of given cyclomatic number
• Strong geodetic problem in grid-like architectures
• Isometric-path numbers of block graphs

This page was built for publication: The isometric path number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747184)