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 University Press
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/}
}
[1] 1. Behzad, M., and Chartrand, G., Introduction to the Theory of Graphs, Allyn and Bacon, Inc., Boston, 1971. Google Scholar
[2] 2. Behzad, M., and Mahmoodian, E., “On Topological Invariants of the Product of Graphs”, Canadian Math. Bull, vol. 12 (1962), pp. 157-166. Google Scholar
[3] 3. Himelwright, P. E., and Williamson, J. E., “On 1-Factorability and Edge-Colorability of Cartesian Products of Graphs”, Elemente Der Mathematik, vol. 29. 3 (1962), pp. 66-67. Google Scholar
[4] 4. Ore, O., The Four Color Problem, Academic Press, New York, 1967. Google Scholar
Cité par Sources :