1 problem
Let be an oriented graph. Its minimum pseudo-semidegree is the minimum among all non-zero in-degrees and out-degrees of its vertices; equivalently, it is th…
Let be an oriented graph. Its minimum pseudo-semidegree is the minimum among all non-zero in-degrees and out-degrees of its vertices; equivalently, it is th…