Essays about: "Star chromatic index"
Found 2 essays containing the words Star chromatic index.
-
1. Upper bounds for the star chromatic index of multipartite graphs
University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenAbstract : A star edge coloring is any edge coloring which is both proper and contains no cycles or path of length four which are bicolored, and the star chromatic index of a graph is the smallest number of colors for which that graph can be star edge colored. Star edge coloring is a relatively new field in graph theory, and very little is known regarding upper bounds of the star chromatic index of most graph types, one of these families being multipartite graphs. READ MORE
-
2. Upper bounds on the star chromatic index for bipartite graphs
University essay from Linköpings universitet/Matematik och tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges according to certain constraints. In this thesis we consider star edge colouring, which is a variant of proper edge colouring where we additionally require the graph to have no two-coloured paths or cycles with length 4. READ MORE