Abstract
The complete graph K n , is said to have a G-decomposition if it is the union of edge disjoint subgraphs each isomorphic to G. The set of values of n for which K n has a G-decomposition is determined if G has four vertices or less.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
