Rankings of Directed Graphs

DOI10.1137/S0895480197330242zbMath0932.05032MaRDI QIDQ4699165

Jan Kratochvíl, Zsolt Tuza

Publication date: 23 November 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmrankingcolouringNP-completenessoriented graphplanar bipartite graphs

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

A lower bound for on-line ranking number of a path ⋮ Edge ranking of graphs is hard ⋮ Easy and hard instances of arc ranking in directed graphs

This page was built for publication: Rankings of Directed Graphs