M. Mahdian. The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....strong edge coloring with at most 5 4 2 colors. Also, it is conjectured by Faudree et al. 4] that every bipartite graph of maximum degree has a strong edge coloring with 2 colors. These conjectures are still wide open. For a summary of results concerning strong edge coloring refer to [13]. The computational complexity of nding a strong edge coloring with the minimum number of colors is studied for chordal graphs in [2] and a polynomial time algorithm for this problem, and another related problem, namely the problem of nding the largest induced matching in the given graph, is ....

....matrices of certain nonlinear functions using a minimum number of gradient evaluations (See [14] or in frequency assignment (broadcast scheduling) in packet radio networks (See [15] This problem is well studied and is proved to be NP complete even for planar graphs of bounded degree. See [13] for a summary of results. Another related problem is the antimatching problem. An antimatching in a graph G is a set A of edges of G such that any two edges in A are of distance at most two. In [2] antimatchings were called neighborly sets) Therefore, the size of the largest antimatching in G ....

M. Mahdian, The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, 2000.

No context found.

M. Mahdian. The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC