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

DOI10.1016/0012-365X(81)90012-1MaRDI QIDQ1152380zbMATH OpenOpenAlexFDO

Authors J. P. Barthélemy

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

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

Cites work

• scientific article; zbMATH DE number 3652393 (Why is no real title available?)
• scientific article; zbMATH DE number 3572226 (Why is no real title available?)
• scientific article; zbMATH DE number 3572227 (Why is no real title available?)
• scientific article; zbMATH DE number 3572228 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3378735 (Why is no real title available?)
• Height on posets and graphs

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

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