Circuits et arbres de circulation d'un graphe fortement connexe
From MaRDI portal
Publication:5655379
DOI10.1051/m2an/197206R200031zbMath0244.05107MaRDI QIDQ5655379
Publication date: 1972
Published in: Revue française d'automatique informatique recherche opérationnelle. Mathématique (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/193210
05C05: Trees
05C35: Extremal problems in graph theory
05C20: Directed graphs (digraphs), tournaments
Related Items
Cites Work