Eternal vertex cover problem is a variant of the classical vertex cover
...
A mixed multigraph is a multigraph which may contain both undirected and...
The eternal vertex cover problem is a dynamic variant of the classical v...
We show that for each non-negative integer k, every bipartite tournament...
An orientation of an undirected graph G is an assignment of exactly one
...
We obtain a new lower bound for the eternal vertex cover number of an
ar...
We derive a local criterion for a plane near-triangulated graph to be
pe...
The eternal vertex cover problem is a variant of the classical vertex co...
The problem of determining Herbrand equivalence of terms at each program...