How to Maximize Minimum Number of Colour Classes for Edge Colouring Using Families of Disjoint Sets Colouring Technique
DOI:
https://doi.org/10.59992/IJSR.2024.v3n12p7الكلمات المفتاحية:
Families of Disjoint Sets Colouring Technique، Minimum Number of Colour Classes، Maximum Number of Colour Classesالملخص
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.
المراجع
1. Frank Harary, “Graph Theory". Addison-Wesley Publication Company, Inc. 1969.
2. Reinhard Diestel, “Graph Theory". Electronic 2000, Spring-Verlag New York 1997, 2000.
3. Hassan, M.E., “Family of Disjoint Sets and its Applications“. IJIRSET Vol. 7. Issue 1, Jan 2018, 362-393.
4. Hassan, M.E., Colouring of Graphs Using Colouring of Families of Disjoint Sets Technique". IJIRSET Vol. 7, Issue 10, October 2018, 10219-10229. Colouring
5. Hassan, M.E., “Types of Colouring and Types of Families of Disjoint Sets”. IJIRSET Vol. 7. Issue 11, Nov 2018, 362-393.
6. Hassan, M.E., “Colouring of finite Sets and Colouring of Edges finite Graphs”. IJIRSET Vol. 7. Issue 12, Dec 2018, 11663-11675.
7. Hassan, M.E., “Sorts of Colour Classes and Sorts of Families of Disjoint Sets”. IJIRSET Vol. 8. Issue 1, Jan2019, 56-63.
8. Hassan, M.E., “Trivial Colouring and Non-Trivial Colouring for Graph’s Edges”. IJIRSET Vol. 8. Issue 2, Feb2019, 1014-1024.
9. Hassan, M.E., “Some Results of Edge Colouring Using Family of Disjoint Colouring Technique”. IJIRSET Vol. 8. Issue 4, April2019, 4667-4675.
10. Hassan, M.E. “Trivial Colouring and Non-Trivial Colouring for Graph’s Vertices”. IJIRSET Vol. 8. Issue 6, June2019, 7398-7410.
11. Hassan, M.E., “Families of Disjoint Sets Colouring Technique and Concept of Common Set and Non Common Set”. IJIRSET Vol. 10. Issue 7, July10491- 10507.
12. Hassan, M.E., “Families of Disjoint Sets Colouring Technique and Concept of Common and Non Common edge “IJIRSET Vol.10 10. Issue 9, September2021. (13280-13296).
13. Hassan, M.E., “Families of Disjoint Sets Colouring Technique and Concept of Common and Non Common Vertex” IJFMR23068622. Volume 5, Issue 6 November-December 2023. (1-14).
14. Douglas B. West, “Introduction to Graph Theory". Second Edition, Department of Mathematics Illinois University, (2001).
15. Wilson, R., “Introduction to Graph Theory". Fourth Edition, Addison Wesley Longman Limited, England, (1996).
