Volume 143, Issue CAug 2024Current Issue
Skip Table Of Content Section
Regular Articles
research-article
Monitoring the edges of a graph using distances with given girth
Abstract
A set M of vertices of a graph G is a distance-edge-monitoring set if for every edge e ∈ G, there is a vertex x ∈ M and a vertex y ∈ G such that e belongs to all shortest paths between x and y. We denote by dem ( G ) the smallest size of such a ...
research-article
Decidable problems in substitution shifts
Abstract
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift ...
research-article
Packing arc-disjoint cycles in oriented graphs
Abstract
Arc-Disjoint Cycle Packing is a classical NP-complete problem and we study it from two perspectives: (1) by restricting the cycles in the packing to be of a fixed length, and (2) by restricting the inputs to bipartite tournaments. Focusing first ...
