[r; s; t]-Coloring of Graphs, M.Sc. Thesis Sharif University of Technology ; Mahmoodian, Ebadollah (Supervisor)
Abstract
Graph coloring is an important concept in graph theory. There have been much developments in this concept recently, vertex coloring, edge coloring and total coloring are studied. But one of the newest kind of graph coloring is [r; s; t] -coloring. This coloring is introduced in 2003 by A. Kemnitz and M. Marangio. In this coloring the difference of any two adjecent vertices, any two adjecent edges, and any adjecent vertex and edge must be at least r, s and t respectively. In this thesis we study [r; s; t] -coloring of graphs and discuss about its results
Cataloging brief[r; s; t]-Coloring of Graphs, M.Sc. Thesis Sharif University of Technology ; Mahmoodian, Ebadollah (Supervisor)
Abstract
Graph coloring is an important concept in graph theory. There have been much developments in this concept recently, vertex coloring, edge coloring and total coloring are studied. But one of the newest kind of graph coloring is [r; s; t] -coloring. This coloring is introduced in 2003 by A. Kemnitz and M. Marangio. In this coloring the difference of any two adjecent vertices, any two adjecent edges, and any adjecent vertex and edge must be at least r, s and t respectively. In this thesis we study [r; s; t] -coloring of graphs and discuss about its results
Find in contentBookmark |
|