On Edge-Colorability of Cartesian Products of Graphs*
E. S. Mahamoodian · Canadian Mathematical Bulletin · 1981
In an article P. E. Himelwright and J. E. Williamson [3] proved a theorem on 1-factorability of Cartesian product of two graphs. With a very short proof we prove a more general theorem which immediately implies their theorem as a corollary. We will follow the notations and definitions of [1], [2] and [3].