On the isometric path partition problem

DOI10.7151/dmgt.2236zbMath1468.05234arXiv1808.09097OpenAlexW2966575401MaRDI QIDQ2042617

Paul D. Manuel

Publication date: 21 July 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09097

zbMATH Keywords

toruscylinderisometric path cover problemisometric path partition problemmulti-dimensional gridspath cover problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Parameterizing path partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric-path numbers of block graphs
• An efficient representation of Benes networks and its applications
• Strong edge geodetic problem in networks
• Finding the shortest path in stochastic networks
• The path partition problem and related problems in bipartite graphs
• Isometric path numbers of graphs
• Path Problems in Networks
• A bicriterion approach for routing problems in multimedia networks
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• The Shortest-Path Problem: Analysis and Comparison of Methods
• Covering hypercubes by isometric paths

This page was built for publication: On the isometric path partition problem