<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Families of Disjoint Sets Colouring Technique Archives - المجلة الدولية للبحوث العلمية</title>
	<atom:link href="https://ijsr.vsrp.co.uk/%D9%83%D9%84%D9%85%D8%A7%D8%AA-%D9%85%D9%81%D8%AA%D8%A7%D8%AD%D9%8A%D8%A9/families-of-disjoint-sets-colouring-technique/feed/" rel="self" type="application/rss+xml" />
	<link></link>
	<description>International Journal for Scientific Research</description>
	<lastBuildDate>Tue, 28 Jan 2025 20:24:21 +0000</lastBuildDate>
	<language>ar</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://ijsr.vsrp.co.uk/wp-content/uploads/2022/08/cropped-My-project-1-6-32x32.png</url>
	<title>Families of Disjoint Sets Colouring Technique Archives - المجلة الدولية للبحوث العلمية</title>
	<link></link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Families of Disjoint Sets Colouring Technique and Concept of Common Face and Non-Common Face</title>
		<link>https://ijsr.vsrp.co.uk/2025/01/families-of-disjoint-sets-colouring-technique-and-concept-of-common-face-and-non-common-face/</link>
		
		<dc:creator><![CDATA[Mansoor ElShiekh Hassan Osman Satti]]></dc:creator>
		<pubDate>Sat, 04 Jan 2025 17:00:33 +0000</pubDate>
				<category><![CDATA[الإصدار 4، العدد 1 ـــــ يناير 2025 ـــــ Vol. 4, No. 1]]></category>
		<category><![CDATA[Improper Clique]]></category>
		<category><![CDATA[Families of Disjoint Sets Colouring Technique]]></category>
		<category><![CDATA[Common Face]]></category>
		<category><![CDATA[Proper Clique]]></category>
		<guid isPermaLink="false">https://ijsr.vsrp.co.uk/?p=4435</guid>

					<description><![CDATA[<p>Authors Associate Professor, Department of Pure Mathematics, Faculty of mathematical Sciences and Informatics, University of Khartoum, Khartoum, Sudan Mansoorsatti4567@gmail.com Paper DOI https://doi.org/10.59992/IJSR.2025.v4n1p12 Abstract Families of disjoint sets colouring technique is trial to generalize all type of colouring and partition. This paper related to face colouring, in this paper we introduce the concept of common face&#8230;&#160;<a href="https://ijsr.vsrp.co.uk/2025/01/families-of-disjoint-sets-colouring-technique-and-concept-of-common-face-and-non-common-face/" rel="bookmark">اقرأ المزيد &#187;<span class="screen-reader-text">Families of Disjoint Sets Colouring Technique and Concept of Common Face and Non-Common Face</span></a></p>
<p>The post <a href="https://ijsr.vsrp.co.uk/2025/01/families-of-disjoint-sets-colouring-technique-and-concept-of-common-face-and-non-common-face/">Families of Disjoint Sets Colouring Technique and Concept of Common Face and Non-Common Face</a> appeared first on <a href="https://ijsr.vsrp.co.uk">المجلة الدولية للبحوث العلمية</a>.</p>
]]></description>
		
		
		
			</item>
		<item>
		<title>How to Maximize Minimum Number of Colour Classes for Edge Colouring Using Families of Disjoint Sets Colouring Technique</title>
		<link>https://ijsr.vsrp.co.uk/2024/12/how-to-maximize-minimum-number-of-colour-classes-for-edge-colouring-using-families-of-disjoint-sets-colouring-technique/</link>
		
		<dc:creator><![CDATA[Mansoor ElShiekh Hassan Osman Satti]]></dc:creator>
		<pubDate>Sat, 07 Dec 2024 17:10:19 +0000</pubDate>
				<category><![CDATA[الإصدار 3، العدد 12 ـــــ ديسمبر 2024 ـــــ Vol. 3, No. 12]]></category>
		<category><![CDATA[Families of Disjoint Sets Colouring Technique]]></category>
		<category><![CDATA[Minimum Number of Colour Classes]]></category>
		<category><![CDATA[Maximum Number of Colour Classes]]></category>
		<guid isPermaLink="false">https://ijsr.vsrp.co.uk/?p=4311</guid>

					<description><![CDATA[<p>Authors Associate Professor, Department of Pure Mathematics, Faculty of mathematical Sciences and Informatics, University of Khartoum, Khartoum, Sudan Mansoorsatti4567@gmail.com Paper DOI https://doi.org/10.59992/IJSR.2024.v3n12p7 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&#8230;&#160;<a href="https://ijsr.vsrp.co.uk/2024/12/how-to-maximize-minimum-number-of-colour-classes-for-edge-colouring-using-families-of-disjoint-sets-colouring-technique/" rel="bookmark">اقرأ المزيد &#187;<span class="screen-reader-text">How to Maximize Minimum Number of Colour Classes for Edge Colouring Using Families of Disjoint Sets Colouring Technique</span></a></p>
<p>The post <a href="https://ijsr.vsrp.co.uk/2024/12/how-to-maximize-minimum-number-of-colour-classes-for-edge-colouring-using-families-of-disjoint-sets-colouring-technique/">How to Maximize Minimum Number of Colour Classes for Edge Colouring Using Families of Disjoint Sets Colouring Technique</a> appeared first on <a href="https://ijsr.vsrp.co.uk">المجلة الدولية للبحوث العلمية</a>.</p>
]]></description>
		
		
		
			</item>
	</channel>
</rss>

<!--
Performance optimized by W3 Total Cache. Learn more: https://www.boldgrid.com/w3-total-cache/?utm_source=w3tc&utm_medium=footer_comment&utm_campaign=free_plugin

Page Caching using Disk: Enhanced 
Lazy Loading (feed)
Minified using Disk

Served from: ijsr.vsrp.co.uk @ 2026-06-23 08:19:27 by W3 Total Cache
-->