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

DOI10.1016/0012-365X(81)90012-1zbMATH Open0461.05034OpenAlexW2074974544MaRDI QIDQ1152380FDOQ1152380

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Height on posets and graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)