Constructive Algorithms For Graph Coloring

Punitha, A and Jayaraman, G (2024) Constructive Algorithms For Graph Coloring. In: RECENT TRENDS IN INFORMATION & COMMUNICATION TECHNOLOGY. UDHAYAS SPNC Publication, Chennai, pp. 85-92. ISBN 9789391871956

Text
Book chap -3.pdf - Published Version
Download (3MB)

Abstract

The field of mathematics plays vital role in various fields. One of the important areas in mathematics is graph theory which is used in structural models. This structural arrangement of various objects or technologies lead to new inventions and modifications in the existing environment for enhancement in those fields. In this paper, we'll present well-known algorithms to solve the graph coloring problem using the greedy, and DSatur approaches and discuss their optimality.

Keywords: Graphs, connectivity, constraints, graph coloring, graph drawing

Item Type:	Book Section
Subjects:	Mathematics > Graph Theory
Domains:	Mathematics
Depositing User:	IR Admin
Date Deposited:	02 Sep 2026 11:10
Last Modified:	02 Sep 2026 11:10
URI:	https://ir.vistas.ac.in/id/eprint/22352

Actions (login required)

: View Item

Altmetric

Citation