Abstract
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].
Publisher
Canadian Mathematical Society
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the unitary one matching Bi-Cayley graph over finite rings;Asian-European Journal of Mathematics;2024-02
2. Interval edge-colorings of composition of graphs;Discrete Applied Mathematics;2017-01
3. On the simultaneous edge coloring of graphs;Discrete Mathematics, Algorithms and Applications;2014-10-10
4. Near Products;Handbook of Product Graphs;2011-06-06
5. The generalized hierarchical product of graphs;Discrete Mathematics;2009-06