Browsing Computer Science and Automation (CSA) by Subject "Graph - Coloring"

Now showing items 1-2 of 2

    • Acyclic Edge Coloring Of Graphs 

      Basavaraju, Manu (2013-10-07)
      A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called ...

    • Rainbow Colouring and Some Dimensional Problems in Graph Theory 

      Rajendraprasad, Deepak (2018-04-05)
      This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ...