An Approach to Solve Graph Coloring Problem Using Linked List Article Swipe
Given an undirected graph G= (V,E) the graph coloring problem consist in assigning a color to each vertex in such a manner that no two adjacent vertex have same color. The processes of assigning the colors in the graph will in a manner such that that the total number of different colors used is minimum. Most of the existing algorithms generally deal this problem by taking consideration above constraint during assigning the color to vertices in the graph, but some time above explicit constraints creates implicit constraints which increases the complexity of the algorithms. In this paper we propose an algorithm for graph coloring problem by using adjacency list which assign the colors to vertices of the graph with minimum number of colors and without creating any implicit constraint in the coloring process.
Related Topics
Concepts
Fractional coloring
List coloring
Combinatorics
Graph coloring
Complete coloring
Adjacency list
Graph power
Greedy coloring
Edge coloring
Vertex (graph theory)
Neighbourhood (mathematics)
Graph
Mathematics
Graph factorization
Computer science
Discrete mathematics
Line graph
Mathematical analysis
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930
- OA Status
- green
- Cited By
- 4
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W3135441697
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3135441697Canonical identifier for this work in OpenAlex
- Title
-
An Approach to Solve Graph Coloring Problem Using Linked ListWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2019Year of publication
- Publication date
-
2019-02-10Full publication date if available
- Authors
-
Ajay Narayan Shukla, M. L. Garg, Rajiv MisraList of authors in order
- Landing page
-
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930Direct OA link when available
- Concepts
-
Fractional coloring, List coloring, Combinatorics, Graph coloring, Complete coloring, Adjacency list, Graph power, Greedy coloring, Edge coloring, Vertex (graph theory), Neighbourhood (mathematics), Graph, Mathematics, Graph factorization, Computer science, Discrete mathematics, Line graph, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
4Total citation count in OpenAlex
- Citations by year (recent)
-
2020: 1, 2019: 3Per-year citation counts (last 5 years)
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3135441697 |
|---|---|
| doi | |
| ids.mag | 3135441697 |
| ids.openalex | https://openalex.org/W3135441697 |
| fwci | 0.83838798 |
| type | article |
| title | An Approach to Solve Graph Coloring Problem Using Linked List |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12401 |
| topics[0].field.id | https://openalex.org/fields/18 |
| topics[0].field.display_name | Decision Sciences |
| topics[0].score | 0.9872999787330627 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1803 |
| topics[0].subfield.display_name | Management Science and Operations Research |
| topics[0].display_name | Scheduling and Timetabling Solutions |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C158319403 |
| concepts[0].level | 5 |
| concepts[0].score | 0.7964209914207458 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5477527 |
| concepts[0].display_name | Fractional coloring |
| concepts[1].id | https://openalex.org/C199594403 |
| concepts[1].level | 5 |
| concepts[1].score | 0.6303309798240662 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1130404 |
| concepts[1].display_name | List coloring |
| concepts[2].id | https://openalex.org/C114614502 |
| concepts[2].level | 1 |
| concepts[2].score | 0.6272363662719727 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[2].display_name | Combinatorics |
| concepts[3].id | https://openalex.org/C76946457 |
| concepts[3].level | 3 |
| concepts[3].score | 0.6050631999969482 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q504843 |
| concepts[3].display_name | Graph coloring |
| concepts[4].id | https://openalex.org/C21642379 |
| concepts[4].level | 5 |
| concepts[4].score | 0.603698194026947 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q3342988 |
| concepts[4].display_name | Complete coloring |
| concepts[5].id | https://openalex.org/C110484373 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5805387496948242 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q264398 |
| concepts[5].display_name | Adjacency list |
| concepts[6].id | https://openalex.org/C149530733 |
| concepts[6].level | 4 |
| concepts[6].score | 0.5483806133270264 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q5597091 |
| concepts[6].display_name | Graph power |
| concepts[7].id | https://openalex.org/C38767284 |
| concepts[7].level | 5 |
| concepts[7].score | 0.5384308099746704 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q5601715 |
| concepts[7].display_name | Greedy coloring |
| concepts[8].id | https://openalex.org/C123809776 |
| concepts[8].level | 5 |
| concepts[8].score | 0.4899963438510895 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1050972 |
| concepts[8].display_name | Edge coloring |
| concepts[9].id | https://openalex.org/C80899671 |
| concepts[9].level | 3 |
| concepts[9].score | 0.47404050827026367 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1304193 |
| concepts[9].display_name | Vertex (graph theory) |
| concepts[10].id | https://openalex.org/C161677786 |
| concepts[10].level | 2 |
| concepts[10].score | 0.46574199199676514 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q2478475 |
| concepts[10].display_name | Neighbourhood (mathematics) |
| concepts[11].id | https://openalex.org/C132525143 |
| concepts[11].level | 2 |
| concepts[11].score | 0.46097129583358765 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[11].display_name | Graph |
| concepts[12].id | https://openalex.org/C33923547 |
| concepts[12].level | 0 |
| concepts[12].score | 0.44635260105133057 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[12].display_name | Mathematics |
| concepts[13].id | https://openalex.org/C128115575 |
| concepts[13].level | 5 |
| concepts[13].score | 0.43462345004081726 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q5597083 |
| concepts[13].display_name | Graph factorization |
| concepts[14].id | https://openalex.org/C41008148 |
| concepts[14].level | 0 |
| concepts[14].score | 0.41069188714027405 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[14].display_name | Computer science |
| concepts[15].id | https://openalex.org/C118615104 |
| concepts[15].level | 1 |
| concepts[15].score | 0.40046426653862 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[15].display_name | Discrete mathematics |
| concepts[16].id | https://openalex.org/C203776342 |
| concepts[16].level | 3 |
| concepts[16].score | 0.2541470527648926 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q1378376 |
| concepts[16].display_name | Line graph |
| concepts[17].id | https://openalex.org/C134306372 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[17].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/fractional-coloring |
| keywords[0].score | 0.7964209914207458 |
| keywords[0].display_name | Fractional coloring |
| keywords[1].id | https://openalex.org/keywords/list-coloring |
| keywords[1].score | 0.6303309798240662 |
| keywords[1].display_name | List coloring |
| keywords[2].id | https://openalex.org/keywords/combinatorics |
| keywords[2].score | 0.6272363662719727 |
| keywords[2].display_name | Combinatorics |
| keywords[3].id | https://openalex.org/keywords/graph-coloring |
| keywords[3].score | 0.6050631999969482 |
| keywords[3].display_name | Graph coloring |
| keywords[4].id | https://openalex.org/keywords/complete-coloring |
| keywords[4].score | 0.603698194026947 |
| keywords[4].display_name | Complete coloring |
| keywords[5].id | https://openalex.org/keywords/adjacency-list |
| keywords[5].score | 0.5805387496948242 |
| keywords[5].display_name | Adjacency list |
| keywords[6].id | https://openalex.org/keywords/graph-power |
| keywords[6].score | 0.5483806133270264 |
| keywords[6].display_name | Graph power |
| keywords[7].id | https://openalex.org/keywords/greedy-coloring |
| keywords[7].score | 0.5384308099746704 |
| keywords[7].display_name | Greedy coloring |
| keywords[8].id | https://openalex.org/keywords/edge-coloring |
| keywords[8].score | 0.4899963438510895 |
| keywords[8].display_name | Edge coloring |
| keywords[9].id | https://openalex.org/keywords/vertex |
| keywords[9].score | 0.47404050827026367 |
| keywords[9].display_name | Vertex (graph theory) |
| keywords[10].id | https://openalex.org/keywords/neighbourhood |
| keywords[10].score | 0.46574199199676514 |
| keywords[10].display_name | Neighbourhood (mathematics) |
| keywords[11].id | https://openalex.org/keywords/graph |
| keywords[11].score | 0.46097129583358765 |
| keywords[11].display_name | Graph |
| keywords[12].id | https://openalex.org/keywords/mathematics |
| keywords[12].score | 0.44635260105133057 |
| keywords[12].display_name | Mathematics |
| keywords[13].id | https://openalex.org/keywords/graph-factorization |
| keywords[13].score | 0.43462345004081726 |
| keywords[13].display_name | Graph factorization |
| keywords[14].id | https://openalex.org/keywords/computer-science |
| keywords[14].score | 0.41069188714027405 |
| keywords[14].display_name | Computer science |
| keywords[15].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[15].score | 0.40046426653862 |
| keywords[15].display_name | Discrete mathematics |
| keywords[16].id | https://openalex.org/keywords/line-graph |
| keywords[16].score | 0.2541470527648926 |
| keywords[16].display_name | Line graph |
| language | en |
| locations[0].id | mag:3135441697 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210172589 |
| locations[0].source.issn | 1556-5068 |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1556-5068 |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | SSRN Electronic Journal |
| locations[0].source.host_organization | https://openalex.org/I1318003438 |
| locations[0].source.host_organization_name | RELX Group (Netherlands) |
| locations[0].source.host_organization_lineage | https://openalex.org/I1318003438 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | submittedVersion |
| locations[0].raw_type | |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | SSRN Electronic Journal |
| locations[0].landing_page_url | https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930 |
| authorships[0].author.id | https://openalex.org/A5051349842 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-2586-3104 |
| authorships[0].author.display_name | Ajay Narayan Shukla |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I933318745 |
| authorships[0].affiliations[0].raw_affiliation_string | DIT University dehradun |
| authorships[0].institutions[0].id | https://openalex.org/I933318745 |
| authorships[0].institutions[0].ror | https://ror.org/01v5k4d73 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I933318745 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Dehradun Institute of Technology University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Ajay Narayan Shukla |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | DIT University dehradun |
| authorships[1].author.id | https://openalex.org/A5061946063 |
| authorships[1].author.orcid | https://orcid.org/0009-0000-0348-8361 |
| authorships[1].author.display_name | M. L. Garg |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I933318745 |
| authorships[1].affiliations[0].raw_affiliation_string | DIT University dehradun |
| authorships[1].institutions[0].id | https://openalex.org/I933318745 |
| authorships[1].institutions[0].ror | https://ror.org/01v5k4d73 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I933318745 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Dehradun Institute of Technology University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | M.L. Garg |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | DIT University dehradun |
| authorships[2].author.id | https://openalex.org/A5081123737 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-4910-5749 |
| authorships[2].author.display_name | Rajiv Misra |
| authorships[2].countries | IN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I132153292 |
| authorships[2].affiliations[0].raw_affiliation_string | Indian Institute of Technology (IIT) Patna |
| authorships[2].institutions[0].id | https://openalex.org/I132153292 |
| authorships[2].institutions[0].ror | https://ror.org/01ft5vz71 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I132153292 |
| authorships[2].institutions[0].country_code | IN |
| authorships[2].institutions[0].display_name | Indian Institute of Technology Patna |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Rajiv Misra |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Indian Institute of Technology (IIT) Patna |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | An Approach to Solve Graph Coloring Problem Using Linked List |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-10-10T17:16:08.811792 |
| primary_topic.id | https://openalex.org/T12401 |
| primary_topic.field.id | https://openalex.org/fields/18 |
| primary_topic.field.display_name | Decision Sciences |
| primary_topic.score | 0.9872999787330627 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1803 |
| primary_topic.subfield.display_name | Management Science and Operations Research |
| primary_topic.display_name | Scheduling and Timetabling Solutions |
| related_works | https://openalex.org/W2955157476, https://openalex.org/W2573312512, https://openalex.org/W2766932952, https://openalex.org/W2313677496, https://openalex.org/W3135398855, https://openalex.org/W2034665826, https://openalex.org/W2277449511, https://openalex.org/W2392493230, https://openalex.org/W1553272085, https://openalex.org/W965915707, https://openalex.org/W1996082231, https://openalex.org/W2039453926, https://openalex.org/W3187209459, https://openalex.org/W1989556004, https://openalex.org/W2185668108, https://openalex.org/W2186663447, https://openalex.org/W2002190731, https://openalex.org/W2017516957, https://openalex.org/W2965326921, https://openalex.org/W1493268504 |
| cited_by_count | 4 |
| counts_by_year[0].year | 2020 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2019 |
| counts_by_year[1].cited_by_count | 3 |
| locations_count | 1 |
| best_oa_location.id | mag:3135441697 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210172589 |
| best_oa_location.source.issn | 1556-5068 |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1556-5068 |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | SSRN Electronic Journal |
| best_oa_location.source.host_organization | https://openalex.org/I1318003438 |
| best_oa_location.source.host_organization_name | RELX Group (Netherlands) |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I1318003438 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | SSRN Electronic Journal |
| best_oa_location.landing_page_url | https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930 |
| primary_location.id | mag:3135441697 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210172589 |
| primary_location.source.issn | 1556-5068 |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1556-5068 |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | SSRN Electronic Journal |
| primary_location.source.host_organization | https://openalex.org/I1318003438 |
| primary_location.source.host_organization_name | RELX Group (Netherlands) |
| primary_location.source.host_organization_lineage | https://openalex.org/I1318003438 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | submittedVersion |
| primary_location.raw_type | |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | SSRN Electronic Journal |
| primary_location.landing_page_url | https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3331930 |
| publication_date | 2019-02-10 |
| publication_year | 2019 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 13, 20, 41 |
| abstract_inverted_index.G= | 4 |
| abstract_inverted_index.In | 94 |
| abstract_inverted_index.an | 1, 99 |
| abstract_inverted_index.by | 64, 105 |
| abstract_inverted_index.in | 11, 18, 36, 40, 75, 129 |
| abstract_inverted_index.is | 53 |
| abstract_inverted_index.no | 23 |
| abstract_inverted_index.of | 32, 49, 56, 91, 115, 121 |
| abstract_inverted_index.to | 15, 73, 113 |
| abstract_inverted_index.we | 97 |
| abstract_inverted_index.The | 30 |
| abstract_inverted_index.and | 123 |
| abstract_inverted_index.any | 126 |
| abstract_inverted_index.but | 78 |
| abstract_inverted_index.for | 101 |
| abstract_inverted_index.the | 6, 34, 37, 46, 57, 71, 76, 89, 92, 111, 116, 130 |
| abstract_inverted_index.two | 24 |
| abstract_inverted_index.Most | 55 |
| abstract_inverted_index.deal | 61 |
| abstract_inverted_index.each | 16 |
| abstract_inverted_index.have | 27 |
| abstract_inverted_index.list | 108 |
| abstract_inverted_index.same | 28 |
| abstract_inverted_index.some | 79 |
| abstract_inverted_index.such | 19, 43 |
| abstract_inverted_index.that | 22, 44, 45 |
| abstract_inverted_index.this | 62, 95 |
| abstract_inverted_index.time | 80 |
| abstract_inverted_index.used | 52 |
| abstract_inverted_index.will | 39 |
| abstract_inverted_index.with | 118 |
| abstract_inverted_index.(V,E) | 5 |
| abstract_inverted_index.Given | 0 |
| abstract_inverted_index.above | 67, 81 |
| abstract_inverted_index.color | 14, 72 |
| abstract_inverted_index.graph | 3, 7, 38, 102, 117 |
| abstract_inverted_index.paper | 96 |
| abstract_inverted_index.total | 47 |
| abstract_inverted_index.using | 106 |
| abstract_inverted_index.which | 87, 109 |
| abstract_inverted_index.assign | 110 |
| abstract_inverted_index.color. | 29 |
| abstract_inverted_index.colors | 35, 51, 112, 122 |
| abstract_inverted_index.during | 69 |
| abstract_inverted_index.graph, | 77 |
| abstract_inverted_index.manner | 21, 42 |
| abstract_inverted_index.number | 48, 120 |
| abstract_inverted_index.taking | 65 |
| abstract_inverted_index.vertex | 17, 26 |
| abstract_inverted_index.consist | 10 |
| abstract_inverted_index.creates | 84 |
| abstract_inverted_index.minimum | 119 |
| abstract_inverted_index.problem | 9, 63, 104 |
| abstract_inverted_index.propose | 98 |
| abstract_inverted_index.without | 124 |
| abstract_inverted_index.adjacent | 25 |
| abstract_inverted_index.coloring | 8, 103, 131 |
| abstract_inverted_index.creating | 125 |
| abstract_inverted_index.existing | 58 |
| abstract_inverted_index.explicit | 82 |
| abstract_inverted_index.implicit | 85, 127 |
| abstract_inverted_index.minimum. | 54 |
| abstract_inverted_index.process. | 132 |
| abstract_inverted_index.vertices | 74, 114 |
| abstract_inverted_index.adjacency | 107 |
| abstract_inverted_index.algorithm | 100 |
| abstract_inverted_index.assigning | 12, 33, 70 |
| abstract_inverted_index.different | 50 |
| abstract_inverted_index.generally | 60 |
| abstract_inverted_index.increases | 88 |
| abstract_inverted_index.processes | 31 |
| abstract_inverted_index.algorithms | 59 |
| abstract_inverted_index.complexity | 90 |
| abstract_inverted_index.constraint | 68, 128 |
| abstract_inverted_index.undirected | 2 |
| abstract_inverted_index.algorithms. | 93 |
| abstract_inverted_index.constraints | 83, 86 |
| abstract_inverted_index.consideration | 66 |
| cited_by_percentile_year.max | 97 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.78105238 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |