About the shortest chain between two vertices in a quasi strongly connected digraph with a potential

DOI10.1016/0012-365X(81)90012-1zbMath0461.05034OpenAlexW2074974544MaRDI QIDQ1152380

Jean-Pierre Barthelemy

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90012-1

zbMATH Keywords

quasi strongly connected digraph

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Height on posets and graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About the shortest chain between two vertices in a quasi strongly connected digraph with a potential