On Edge-Colorability of Cartesian Products of Graphs*
Canadian mathematical bulletin, Tome 24 (1981) no. 1, pp. 107-108
Voir la notice de l'article provenant de la source Cambridge
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].
Mahamoodian, E. S. On Edge-Colorability of Cartesian Products of Graphs*. Canadian mathematical bulletin, Tome 24 (1981) no. 1, pp. 107-108. doi: 10.4153/CMB-1981-017-9
@article{10_4153_CMB_1981_017_9,
author = {Mahamoodian, E. S.},
title = {On {Edge-Colorability} of {Cartesian} {Products} of {Graphs*}},
journal = {Canadian mathematical bulletin},
pages = {107--108},
year = {1981},
volume = {24},
number = {1},
doi = {10.4153/CMB-1981-017-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1981-017-9/}
}
Cité par Sources :