Abstract A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has a neighbor in each ...

We determine the Martin boundary for aperiodic simple random walk on a bi-tree, that is, the Cartesian product of two homogeneous trees. This is obtained by first deriving a "renewal theorem," giving ...