On a characterization of graphs by average labellings
The additive hereditary property of linear forests is characterized by the existence of average labellings.
The additive hereditary property of linear forests is characterized by the existence of average labellings.
For given nonnegative integers k,s an upper bound on the minimum number of vertices of a strongly connected digraph with exactly k kernels and s solutions is presented.
In the paper we deal with a task about two circles touching in a rectangle. The assignment of the task was formulated in a fuzzy way, so solvers understood it differently. We present extracts from the authentic solutions which reflect this phenomenon. We suggest an approach to such tasks, how to solve them and how to assess their solutions.
Page 1