CONSTRUCTION OF LARGE PACKET RADIO NETWORKS
Jean‐Claude Bermond, Pavol Hell, Jean-Jacques Quisquater · Parallel Processing Letters · 1992
We outline constructions of packet radio networks (with time division multiplexing) that achieve much better parameters than those previously proposed. Given the desired diameter and number of slots per time frame, our networks seek to maximize the possible number of users. We model this as a problem of constructing large graphs or digraphs with given diameter and chromatic index, and relate it to extant work on large graphs with given diameter and maximum degree.