Lower bounds on the lengths of node sequences in directed graphs

DOI10.1016/S0012-365X(76)80007-6zbMath0347.05107OpenAlexW1978270190MaRDI QIDQ1233875

George Markowsky, Robert Endre Tarjan

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(76)80007-6

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Pathlistings applied to data flow analysis

Cites Work

• A lower bound on the length of a sequence containing all permutations as subsequences
• Characterizations of Reducible Flow Graphs
• Shortest string containing all permutations
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds on the lengths of node sequences in directed graphs