Given a graph G and an integer k, the objective of the Π-Contraction
pro...
A proper k-coloring of a graph G is a neighbor-locating
k-coloring if fo...
We study upper bounds on the size of optimum locating-total dominating s...
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph havin...
share