Abstract

Let G[H] denote the composition of the graphs G and H. If G can be decomposed into one-factors and two-factors, H can be decomposed into one-factors, and H is not the empty graph on an odd number of vertices, then G[H] can be decomposed into one-factors.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.