Hostname: page-component-6d856f89d9-5pczc Total loading time: 0 Render date: 2024-07-16T06:47:38.704Z Has data issue: false hasContentIssue false
  • English
  • Français

On Edge-Colorability of Cartesian Products of Graphs*

Published online by Cambridge University Press:  20 November 2018

E. S. Mahamoodian
E. S. Mahamoodian*
Affiliation:
Department of Mathematics, Community College of Philadelphia, Philadelphia, Pa. 19107
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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].

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 24 , Issue 1 , 01 March 1981 , pp. 107 - 108
Copyright
Copyright © Canadian Mathematical Society 1981

References

1. Behzad, M., and Chartrand, G., Introduction to the Theory of Graphs, Allyn and Bacon, Inc., Boston, 1971.Google Scholar
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. 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. Ore, O., The Four Color Problem, Academic Press, New York, 1967.Google Scholar