Rankings of Directed Graphs

DOI10.1137/S0895480197330242MaRDI QIDQ4699165zbMATH OpenFDO

Authors Jan Kratochvíl, Zsolt Tuza

Publication date 23 November 1999

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

Full work available at URL https://doi.org/10.1137/S0895480197330242

zbMATH Keywords

algorithmcolouringNP-completenessoriented graphplanar bipartite graphsranking

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1262792
• Easy and hard instances of arc ranking in directed graphs
• An optimal k-ranking characterization of oriented paths and cycles
• Rank numbers of graphs that are combinations of paths and cycles
• Rankings of Graphs

Cited in

(15)

• Edge ranking of graphs is hard
• Beyond rankings: comparing directed acyclic graphs
• Graph 2-rankings
• The degree ratio ranking method for directed graphs
• Easy and hard instances of arc ranking in directed graphs
• List rankings and on-line list rankings of graphs
• An optimal k-ranking characterization of oriented paths and cycles
• Ranking measures for radially Moore graphs
• Theoretical and complexity results for minimal rankings
• Ranking the Vertices of a Paired Comparison Digraph
• scientific article; zbMATH DE number 139900 (Why is no real title available?)
• scientific article; zbMATH DE number 1262792 (Why is no real title available?)
• On graphs associated to sets of rankings
• Ranking numbers of graphs
• A lower bound for on-line ranking number of a path

This page was built for publication: Rankings of Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699165)