scientific article; zbMATH DE number 1439423

MaRDI QIDQ4949797zbMATH OpenFDO

Authors S. L. Fitzpatrick

Publication date 18 September 2001

zbMATH Keywords

boundsCartesian product of pathscoverdiameterisometric path number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• The isometric path number of a graph
• Isometric path numbers of graphs
• The ultimate isometric path number of a graph
• Fractional isometric path number
• Isometric-path numbers of block graphs

Cited in

(19)

• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
• On the isometric path partition problem
• The general position number of Cartesian products involving a factor with small diameter
• Strong geodetic problem in networks
• Strong geodetic cores and Cartesian product graphs
• Strong edge geodetic problem in networks
• Isometric path numbers of graphs
• The isometric path number of a graph
• The ultimate isometric path number of a graph
• scientific article; zbMATH DE number 1472194 (Why is no real title available?)
• Strong geodetic problem on Cartesian products of graphs
• A general position problem in graph theory
• scientific article; zbMATH DE number 5049609 (Why is no real title available?)
• Fractional isometric path number
• Covering hypercubes by isometric paths
• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• The geodesic cover problem for butterfly networks
• Isometric-path numbers of block graphs

This page was built for publication:

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