In this paper we consider specific directed graphs called "ladders". The vertices of the graph are randomly colored by green or red. Deleting the edges with at least one red endpoint one gets a random ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback