The number of arc routing publications has increased significantly in the last decade. Such
an increase justifies a second annotated bibliography, a sequel to Corberán and Prins …

The Chinese postman problem is a classic resource allocation and scheduling problem,
which has been widely used in practice. As a classical nondeterministic polynomial problem …

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 …

A spanning circuit in a graph is defined as a closed trail visiting each vertex of the graph. A
compatible spanning circuit in an edge-colored graph refers to a spanning circuit in which …

We give a formal definition of a multiplex network and using its supra-adjacency matrix
representation we construct the multiplex communicability matrix. Then we prove that the …

A path (cycle) in a c-edge-colored multigraph is alternating if no two consecutive edges have
the same color. The problem of determining the existence of alternating Hamiltonian paths …

In an edge-colored graph (G, c), let dc (v) denote the number of colors on the edges incident
with a vertex v of G and δ c (G) denote the minimum value of dc (v) over all vertices v∈ V …

A properly colored walk in an edge-colored graph is a walk such that consecutive edges are
of distinct colors. In this paper, based on a transformation from directed graphs to edge …

In view of the interesting applications of alternating Euler trails, it is natural to ask about the
existence of Euler trails fulfilling some restriction other than alternating. Let H be a graph …

Homologous recombination between the maternal and paternal copies of a chromosome is
a key mechanism for human inheritance and shapes population genetic properties of our …