### Abstract

A ranking of a graph is a coloring of the vertex set with positive integers in such a way 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 consecutively. We show that the ranking number of an orientation of a 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.

Original language | English |
---|---|

Pages (from-to) | 374-384 |

Number of pages | 11 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 12 |

Issue number | 3 |

DOIs | |

Publication status | Published - Sep 1999 |

### Keywords

- Algorithm
- Directed graph
- Graph
- NP-completeness
- Oriented graph
- Ranking

### ASJC Scopus subject areas

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Rankings of directed graphs'. Together they form a unique fingerprint.

## Cite this

*SIAM Journal on Discrete Mathematics*,

*12*(3), 374-384. https://doi.org/10.1137/S0895480197330242