CIRCULAR CHOOSABILITY OF GRAPHS

• Author(s):

  R.Aruna | G.Abilaasha

• Keywords:

  Chromatic Number, Circular Coloring, Circular List Assignment, K-degenerate Graph.

• 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 ?(?) ≤ ??(?) ≤ Δ(?) +

---

Other Details

• Paper id:

  IJSARTV2I116039

• Published in:

  Volume: 2 Issue: 11 November 2016

• Publication Date:

  2016-11-16

Download Article