Group coloring via its geometric structures

Let Γ be a graph with vertex set V (Γ) and edge set E(Γ). A vertex coloring of Γ is an assignment of colors to V (Γ), so that no any two adjacent vertices share the same color. Meanwhile an edge coloring of Γ is an assignment of colors to E(Γ), so that no any two incident edges share the same color....

Full description

Saved in:
Bibliographic Details
Main Authors: Muhammed Bello, Muhammed Bello, Mohd. Ali, Nor Muhainiah
Format: Conference or Workshop Item
Published: 2021
Subjects:
Online Access:http://eprints.utm.my/id/eprint/98077/
http://dx.doi.org/10.1063/5.0057313
Tags: Add Tag
No Tags, Be the first to tag this record!