The universality property of the Rado graph can be extended to edge-colored graphs; that is, graphs in which the edges have been assigned to different color classes, but without the usual edge coloring requirement that each color class form a matching. For any finite or countably infinite number of colors χ, there exists a unique countably-infinite χ-edge-colored graph "G"χ such that every partial isomorphism of a χ-edge-colored finite graph can be extended to a full isomorphism. With this notation, the Rado graph is just "G"1. investigates the automorphism groups of this more general family of graphs.