Research Topic

Coloring

5 Publications Matching this Keyword

Impact Factor
7.883
Coloring

5 Matching Papers


All Categories
Publish Your Paper

Submit your research manuscript for fast peer review and publication.

Submit Paper

Papers tagged with "Coloring"

Showing page 1 of 1
Vol 4, Issue 4 (April 2018) Mathematics

ANTI-FUZZY GRAPH COLORING

In This Paper, The Concept Of Coloring The Anti-fuzzy Graph, Strong Anti-fuzzy Graph And Complete Anti-fuzzy Graph Are Introduced With Illustrative Examples.

Prasanna, M.A.Rifayathali, S. Ismail Mohideen
Vol 4, Issue 3 (March 2018) Mathematics

Maximum and Minimum coloring of certain triangular line graphs

The Line Graph L(G) Of An Undirected Graph G Is Another Graph L(G) That Represents The Find Adjacencies Between The Edges Of G. In This Paper, We Find The Maximum And Minimum Of Total Coloring For A Certain Line Graphs Of A Snake Graph Fam...

Pralahad Mahagaonkar
Vol 4, Issue 2 (February 2018) Mathematics

Perfect Coloring of Planar Graphs And Related Aspects

This Paper Defines A Conjecture On The Coloring Of Planar Graph, Known As The Perfect Coloring Of Planar Graph. We Intend To Study The Relation Between Semi Perfect Coloring And Perfect Coloring Of Graphs. Precisely, We Prove This Conjectur...

H. R. Bhapkar
Vol 3, Issue 11 (November 2017) GRAPH THEORY

CIRCULAR CHROMATIC NUMBER

This Paper Attempts To Study The Circular Chromatic Number Of A Graph G Was Introduced By Vince (also Known As The Star Chromatic Number) Is A Natural Generalization Of The Chromatic Number Of A Graph. In This Paperwe Concentrating On T...

R.Aruna, N.R.Jagadeeswary
Vol 2, Issue 11 (November 2016) Mathematics

CIRCULAR CHOOSABILITY OF GRAPHS

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 ?(?) ≤...

R.Aruna, G.Abilaasha

Submit Your Paper to IJSART

Join the global research community with IJSART. Submit your paper, share your work, and gain worldwide recognition!