Bermond, Jean-Claude; Hell, Pavol; Liestman, Arthur L.; Peters, Joseph G. Sparse broadcast graphs. (English) Zbl 0764.05042 Discrete Appl. Math. 36, No. 2, 97-130 (1992). Reviewer: S.Stahl (Lawrence) MSC: 05C35 05C90 68Q85 94C15 PDFBibTeX XMLCite \textit{J.-C. Bermond} et al., Discrete Appl. Math. 36, No. 2, 97--130 (1992; Zbl 0764.05042) Full Text: DOI
Bermond, J.-C.; Heinrich, Katherine; Yu, Min-Li Existence of resolvable path designs. (English) Zbl 0712.05045 Eur. J. Comb. 11, No. 3, 205-211 (1990). Reviewer: B.Alspach MSC: 05C70 PDFBibTeX XMLCite \textit{J. C. Bermond} et al., Eur. J. Comb. 11, No. 3, 205--211 (1990; Zbl 0712.05045) Full Text: DOI
Bermond, J.-C.; Homobono, N.; Peyrat, C. Large fault-tolerant interconnection networks. (English) Zbl 0672.94021 Graphs Comb. 5, No. 2, 107-123 (1989). MSC: 94C15 PDFBibTeX XMLCite \textit{J. C. Bermond} et al., Graphs Comb. 5, No. 2, 107--123 (1989; Zbl 0672.94021) Full Text: DOI
Bermond, J. C.; Fouquet, J. L.; Habib, M.; Peroche, B. On linear k-arboricity. (English) Zbl 0556.05054 Discrete Math. 52, 123-132 (1984). Reviewer: P.Hell MSC: 05C70 05C15 05C38 05B30 PDFBibTeX XMLCite \textit{J. C. Bermond} et al., Discrete Math. 52, 123--132 (1984; Zbl 0556.05054) Full Text: DOI
Bermond, J. C.; Schönheim, J. \(G\)-decomposition of \(K_n\), where G has four vertices or less. (English) Zbl 0376.05016 Discrete Math. 19, 113-120 (1977). MSC: 05B30 05C99 PDFBibTeX XMLCite \textit{J. C. Bermond} and \textit{J. Schönheim}, Discrete Math. 19, 113--120 (1977; Zbl 0376.05016) Full Text: DOI