We considervertex coloring of a simple acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural way when clustering, indexing and bounding space for various genetic data for efficient analysis. We discuss the corresponding chromatic number and derive an upper bound as a function of the maximum number of descendants of a given vertex and the inductiveness of the corresponding hypergraph, which is obtained from the original digraph. ©Springer-Verlag 2004.
CITATION STYLE
Agnarsson, G., Egilsson, Á. S., & Halldórsson, M. M. (2004). Proper down-coloringSimple acyclic digraphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3062, 299–312. https://doi.org/10.1007/978-3-540-25959-6_22
Mendeley helps you to discover research relevant for your work.