Mixed graph colorings
暂无分享,去创建一个
A mixed graphGπ contains both undirected edges and directed arcs. Ak-coloring ofGπ is an assignment to its vertices of integers not exceedingk (also called colors) so that the endvertices of an edge have different colors and the tail of any arc has a smaller color than its head. The chromatic number γπ(G) of a mixed graph is the smallestk such thatGπ admits ak-coloring. To the best of our knowledge it is studied here for the first time. We present bounds of γ(G), discuss algorithms to find this quantity for trees and general graphs, and report computational experience.
[1] David W. Matula,et al. GRAPH COLORING ALGORITHMS , 1972 .
[2] B. Roy. Nombre chromatique et plus longs chemins d'un graphe , 1967 .
[3] Nicola Santoro,et al. Min-max heaps and generalized priority queues , 1986, CACM.
[4] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..
[5] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.