Impact Factor
7.883
Call For Paper
Volume 12 Issue 07
July 2026
Download Paper Format
Copyright Form
Author(s)
R.Aruna G.Abilaasha
Abstract
This Paper Attempts To Study The Concept Of Circular Choosability Of Graph G (also Called List Chromatic Number Or Choice Number) It Is Denoted By l G, Which Is The Minimum K Such That G Is T-choosable. It Should Be Clear That ?(?) ≤ ??(?) ≤ Δ(?) +
Keywords
Chromatic Number
Circular Coloring
Circular List Assignment
K-degenerate Graph.
Paper ID
IJSARTV2I116039
Publication Date
November 16, 2016
Research Area
Mathematics