Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM20510
Volume:
7 |
5 |
May 2023
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Graph coloring problem is one of the most popular areas in the field of graph theory and has a long and illustrious history. In a graph coloring, each edge of the graph is colored in such a manner that no two adjacent edges have the same color. So far there are several techniques are presented for edge coloring. In this paper, we propose an paper based on the parse tree, to color all the edges of the given graph with the minimum number of colors and we provide the explanation for the proposed paper. This paper helps us to determine the chromatic number of any graph.
KEYWORDS
Publication Date
5/13/2023
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
1
Total views since publication
PDF Downloads
1
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...