Sterboul, Francois Circuits et arbres de circulation d’un graphe fortement connexe. (French) Zbl 0244.05107 Rev. Franc. Automat. Inform. Rech. Operat. 6, R-2, 3-8 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 05C20 Directed graphs (digraphs), tournaments 05C35 Extremal problems in graph theory 05C05 Trees PDFBibTeX XMLCite \textit{F. Sterboul}, Rev. Franc. Automat. Inform. Rech. Operat., R 6, No. 2, 3--8 (1972; Zbl 0244.05107) Full Text: DOI EuDML References: [1] C. BERGE, Grapheset Hypergraphes, Dunod, 1970, p. 22-39, Zbl0213.25702 MR898652 · Zbl 0213.25702 [2] G. CHATY, < Cheminements remarquables dans les Graphes>, Thèse de Doctorat d’État, Paris, 1971. Zbl0247.05131 · Zbl 0247.05131 [3] G. CHATY, Graphes fortement connexes C-minimaux, C.R.A.S., 266, 1968, 907-909. Zbl0162.27804 MR234862 · Zbl 0162.27804 [4] G. CHATY, Graphes fortement connexes C-minimaux et graphes sans circuits co-minimaux, J. Combinatorial Theory.Vol. 10, n^\circ 3, Juin 1971. Zbl0217.02502 MR297633 · Zbl 0217.02502 · doi:10.1016/0095-8956(71)90048-7 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.