ScholarLens Back to search
2022•International Journal of Statistics and Applied MathematicsOpen access

Study of algorithm for coloring in various graph

Ayushi Malviya, Bhawna Agrawal, Sanjeet Kumar, Akhlak Mansuri

Open full text 2 citations

Abstract

Graph coloring is an important area of mathematics and computer science. Graph coloring problem is getting more famous to solve the variety of real-world problems like map coloring, timetabling and scheduling. Graph coloring is allied with two types of coloring as vertex and edge coloring. Algorithm is a set of rules that must be followed when solving a particular coloring problem and algorithms plays an important role in graph coloring. The main objective of this paper is to study of various algorithms in graph coloring.

Open-access reader

About this research paper

What this paper is about

Graph coloring is an important area of mathematics and computer science. Graph coloring problem is getting more famous to solve the variety of real-world problems like map coloring, timetabling and scheduling. Graph coloring is allied with two types of coloring as vertex and edge coloring. Algorithm is a set of rules that must be followed when solving a particular coloring problem and algorithms plays an important role in graph coloring. The main objective of this paper is to study of various algorithms in graph coloring.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Graph coloring is an important area of mathematics and computer science. Graph coloring problem is getting more famous to solve the variety of real-world problems like map coloring, timetabling and scheduling. Graph coloring is allied with two types of coloring as vertex and edge coloring. Algorithm is a set of rules that must be followed when solving a particular coloring problem and algorithms plays an important role in graph coloring. The main objective of this paper is to study of various algorithms in graph coloring.

Key concepts: Graph coloring, Greedy coloring, Fractional coloring, Edge coloring, Complete coloring, List coloring, Computer science, Graph factorization

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Study of algorithm for coloring in various graph — Research Paper | ScholarLens