Abstract
A ranking of a graph is a coloring of the vertex set with positive integers such that on every path connecting two vertices of the same color there is a vertex of larger color. We consider the directed variant of this problem, where the above condition is imposed only on those paths in which all edges are oriented in the same direction. We show that the ranking number of a directed tree is bounded by that of its longest directed path plus one, and that it can be computed in polynomial time. Unlike the undirected case, however, deciding whether the ranking number of a directed (and even of an acyclic directed) graph is bounded by a constant is NP-complete. In fact, the 3-ranking of planar bipartite acyclic digraphs is already hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bodlaender, H., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., Müller, H., Tuza, Z.: Rankings of graphs. In: Mayr, E.W., et al. (eds.) WG 1994. LNCS, vol. 903, pp. 292–304. Springer, Heidelberg (1995); Extended version in: SIAM J. Discr. Math. 11, 168–181 (1998)
Hujter, M., Tuza, Z.: Precoloring extension. II. Graph classes related to bipartite graphs. Acta Math. Univ. Carolinae 62, 1–11 (1993)
Hujter, M., Tuza, Z.: Precoloring extension. III. Classes of perfect graphs. Combin. Probab. Computing 5, 35–56 (1996)
Kratochvíl, J.: Precoloring extension with fixed color bound. Acta Math. Univ. Carolinae 62, 139–153 (1993)
Kratochvíl, J., Sebö, A.: Coloring precolored perfect graphs. J. Graph Theory 25, 207–215 (1995)
Lam, T.W., Yue, F.L.: Egde ranking is NP-complete. To appear in Discrete Applied Math.
Tuza, Z.: Graph colorings with local constraints—A survey. Discuss. Math. Graph Theory 17, 161–228 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kratochvíl, J., Tuza, Z. (1998). Rankings of Directed Graphs. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_10
Download citation
DOI: https://doi.org/10.1007/10692760_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive