EUVIMEDObjevte EUVIMED
Crossref

A Study on Vertex Coloring and Edge Coloring and its Application

Nanthitha MM, Sampoornam M, Kalaiarasi S

Journal of Computational Mathematica · 2026-06-30 · 10 (2) · 102-130

DOI: 10.26524/cm241 ↗

At a glance

Journal article in Journal of Computational Mathematica, published online on 2026-06-30. Written by Nanthitha MM and 2 co-authors.

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

Graph coloring is an important area of graph theory that deals with assigning colors to the vertices and edges of a graph under certain conditions. Vertex coloring ensures that adjacent vertices have different colors, while edge coloring ensures that adjacent edges receive different colors. This study presents the basic concepts of vertex coloring and edge coloring and discusses their practical applications in scheduling, timetabling, frequency assignment, map coloring, and resource allocation. These coloring techniques help in minimizing conflicts and optimizing the efficient use of resources in various real-world problems.

Cite

APA

MM, N., M, S., & S, K. (2026). A Study on Vertex Coloring and Edge Coloring and its Application. Journal of Computational Mathematica, 10(2), 102-130. https://doi.org/10.26524/cm241

Vancouver

MM N, M S, S K. A Study on Vertex Coloring and Edge Coloring and its Application. Journal of Computational Mathematica. 2026;10(2):102-130. doi:10.26524/cm241

BibTeX
@article{MM2026,
  author = {MM, Nanthitha and M, Sampoornam and S, Kalaiarasi},
  title = {A Study on Vertex Coloring and Edge Coloring and its Application},
  journal = {Journal of Computational Mathematica},
  year = {2026},
  volume = {10},
  number = {2},
  pages = {102--130},
  doi = {10.26524/cm241}
}
Start for free →