An optimal k-ranking characterization of oriented paths and cycles

zbMATH Open1220.05048MaRDI QIDQ2999994FDOQ2999994

Authors: Rigoberto Flórenz, Darren Narayan 

Publication date: 18 May 2011

Recommendations

• Maximum minimal rankings of oriented trees
• Extrema property of the \(k\)-ranking of directed paths and cycles
• Rank numbers of graphs that are combinations of paths and cycles
• Rankings of Directed Graphs
• A characterization of optimal \(k\)-rankings of paths and cycles

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cited In (7)

• A characterization of optimal \(k\)-rankings of paths and cycles
• A lower bound for on-line ranking number of a path
• Extrema property of the \(k\)-ranking of directed paths and cycles
• Maximum minimal rankings of oriented trees
• Greedy algorithms for generalized \(k\)-rankings of paths
• Minimal rankings and the arank number of a path
• Further results on minimal rankings

This page was built for publication: An optimal \(k\)-ranking characterization of oriented paths and cycles

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