Circuits et arbres de circulation d'un graphe fortement connexe

DOI10.1051/m2an/197206R200031zbMath0244.05107MaRDI QIDQ5655379

F. Sterboul

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

Mathematics Subject Classification ID

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

Related Items (1)

On signed digraphs with all cycles negative

Cites Work

• Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Circuits et arbres de circulation d'un graphe fortement connexe