Barth, Dominique; Heydemann, Marie-Claude A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs. (English) Zbl 0878.05041 Discrete Appl. Math. 77, No. 2, 99-118 (1997); errata ibid. 80, 115 (1997). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{D. Barth} and \textit{M.-C. Heydemann}, Discrete Appl. Math. 77, No. 2, 99--118 (1997; Zbl 0878.05041) Full Text: DOI Link
Heydemann, M. C.; Sotteau, D. A note on recursive properties of the de Bruijn, Kautz and FFT digraphs. (English) Zbl 0875.68683 Inf. Process. Lett. 53, No. 5, 255-259 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{M. C. Heydemann} and \textit{D. Sotteau}, Inf. Process. Lett. 53, No. 5, 255--259 (1995; Zbl 0875.68683) Full Text: DOI
Heydemann, M. C.; Opatrny, J.; Sotteau, D. Broadcasting and spanning trees in de Bruijn and Kautz networks. (English) Zbl 0755.94017 Discrete Appl. Math. 37-38, 297-317 (1992). MSC: 94C15 05C20 PDFBibTeX XMLCite \textit{M. C. Heydemann} et al., Discrete Appl. Math. 37--38, 297--317 (1992; Zbl 0755.94017) Full Text: DOI
Heydemann, M. C. Minimum number of circuits covering the vertices of a strong digraph. (English) Zbl 0571.05031 Cycles in graphs, Workshop Simon Fraser Univ., Burnaby/Can. 1982, Ann. Discrete Math. 27, 287-296 (1985). Reviewer: W.-K.Chen MSC: 05C38 05C20 05C35 PDFBibTeX XML
Heydemann, M. C. Nombre maximum d’arcs d’un graphe antisymetrique sans chemin de longueur l. (French) Zbl 0522.05029 Ann. Discrete Math. 17, 337-346 (1983). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{M. C. Heydemann}, Ann. Discrete Math. 17, 337--346 (1983; Zbl 0522.05029) Full Text: DOI
Heydemann, M. C. Degrees and cycles in digraphs. (English) Zbl 0488.05040 Discrete Math. 41, 241-251 (1982). MSC: 05C20 05C38 05C35 PDFBibTeX XMLCite \textit{M. C. Heydemann}, Discrete Math. 41, 241--251 (1982; Zbl 0488.05040) Full Text: DOI
Bermond, J. C.; Germa, A.; Heydemann, M. C.; Sotteau, D. Longest paths in digraphs. (English) Zbl 0488.05039 Combinatorica 1, 337-341 (1981). MSC: 05C20 05C38 05C75 PDFBibTeX XMLCite \textit{J. C. Bermond} et al., Combinatorica 1, 337--341 (1981; Zbl 0488.05039) Full Text: DOI
Bermond, J. C.; Sotteau, D.; Germa, A.; Heydemann, M. C. Chemins et circuits dans les graphes orientes. (French) Zbl 0453.05032 Ann. Discrete Math. 8, 293-309 (1980). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{J. C. Bermond} et al., Ann. Discrete Math. 8, 293--309 (1980; Zbl 0453.05032) Full Text: DOI