Covering hypercubes by isometric paths

DOI10.1016/S0012-365X(01)00197-2MaRDI QIDQ5948983zbMATH OpenOpenAlexFDO

Authors S. L. Fitzpatrick, R. J. Nowakowski, Derek Holton, Ian Caines

Publication date 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00197-2

zbMATH Keywords

hypercubesisometric pathshortest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The isometric path number of a graph
• Isometric path numbers of graphs
• scientific article; zbMATH DE number 1439423
• Symmetric routings of the hypercube
• The ultimate isometric path number of a graph

Cited in

(7)

• On the isometric path partition problem
• Isometric path numbers of graphs
• scientific article; zbMATH DE number 4112541 (Why is no real title available?)
• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• The geodesic cover problem for butterfly networks
• Isometric and induced path partitions: a new upper bound and a characterization of some extremal graphs
• Isometric-path numbers of block graphs

This page was built for publication: Covering hypercubes by isometric paths

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