We study the SHORTEST PATH problem with positive disjunctive constraints...
Given an undirected graph G and q integers n_1,n_2,n_3, ⋯, n_q,
balanced...
For two given nonnegative integers h and k, an L(h,k)-edge labeling of
a...
We introduce a variant of the graph coloring problem, which we denote as...
share