On Equitable Coloring of Certain Graphs
No Thumbnail Available
Date
2024
Journal Title
Journal ISSN
Volume Title
Publisher
Library Information Services, COMSATS University Islamabad, Lahore Campus
Abstract
In this project, we explore several fundamental concepts in graph theory,
focusing primarily equitable edge coloring. An equitable edge coloring of a
graph is a proper edge coloring for which the difference between any two
color classes is at most one. The minimum cardinality of G for such
coloring is called equitable edge chromatic number.
Description
Keywords
Department of Mathematics, FA20, Mathematics, Equitable, Coloring, Certain Graphs, Dr. M. Faisal Nadeem