Abstract

In this paper we use families of disjoint sets colouring technique, to introduce some results of edge colouring for minimum and maximum number of colour classes, and introduce a results explains how to find different values of minimum colour classes, and how to maximize minimum number of colour classes for edge colouring, when maximum degree of vertex is fixed, here we prove a result as a method for finding minimum number of colour classes for edge colouring. Families of disjoint sets colouring technique, as generalization technique deal even with graph of multiple edges, and here graph of multiple edges given as application of some examples and results.

Full Text

Published Version

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.