The notion of forbidden-transition graphs allows for a robust generalization of walks in
graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is …

In this paper we study variants of well-known graph problems: vertex cover, connected
vertex cover, dominating set, total dominating set, independent dominating set, spanning …

Total dominating set, connected vertex cover and Steiner tree are well-known graph
problems. Despite the fact that they are NP-complete to optimize, it is easy (even trivial) to …

In this work we study an extension of the ordinary one-to-many shortest path problem that
also considers additional disjunctive conflict relations between the arcs: an optimal shortest …

Domination problems have been studied in graph theory for decades. In most of them, it is
NP-complete to find an optimal solution, while it is easy (and even trivial in some cases) to …

Abstract A subset D⊆ V is an independent (or stable) dominating set of a graph G=(V, E) if D
is an independent set (ie, there are no edges between vertices of D) and dominates all the …

A sequence P of vertices v 1,…, vk from a directed graph (or digraph) D=(V, A) is a directed
route (or diroute) if (vi, vi+ 1)∈ A for 1≤ i≤ k-1. In this paper, we study a generalisation of …

The problem of choosing an optimal codon sequence arises when synthetic protein-coding
genes are added to cloning vectors for expression within a non-native host organism: to …

A forbidden transition graph is a graph defined together with a set of permitted transitions ie
unordered pair of adjacent edges that one may use consecutively in a walk in the graph. In …

In this paper, we investigate the problem of determining s− t reachability in choice networks.
In the traditional s− t reachability problem, we are given a weighted network tuple G=< V, E …