Publications of year 1981

J-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Longest paths in digraphs. Combinatorica, 1(4):337--341, 1981. [PDF ]

@article{MR647983,
AUTHOR = {Bermond, J-C. and Germa, A. and Heydemann, M.-C. and Sotteau, D.},
TITLE = {Longest paths in digraphs},
JOURNAL = {Combinatorica},
VOLUME = {1},
YEAR = {1981},
NUMBER = {4},
PAGES = {337--341},
ISSN = {0209-9683},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BGHS81.pdf},

}

J-C. Bermond and C. Thomassen. Cycles in digraphs---a survey. J. Graph Theory, 5(1):1--43, 1981.

@article{MR604304,
AUTHOR = {Bermond, J-C. and Thomassen, C.},
TITLE = {Cycles in digraphs---a survey},
JOURNAL = {J. Graph Theory},
VOLUME = {5},
YEAR = {1981},
NUMBER = {1},
PAGES = {1--43},
ISSN = {0364-9024},

}

Conference's articles

J-C. Bermond and B. Bollobás. The diameter of graphs---a survey. In Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981), volume 32, pages 3--27, 1981. [PDF ]

@inproceedings{MR681867,
AUTHOR = {Bermond, J-C. and Bollob{\'a}s, B.},
TITLE = {The diameter of graphs---a survey},
BOOKTITLE = {Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981)},
JOURNAL = {Congr. Numer.},
VOLUME = {32},
YEAR = {1981},
PAGES = {3--27},
ISSN = {0384-9864},
PDF = {http://www-sop.inria.fr/members/Jean-Claude.Bermond/PUBLIS/BeBo81.pdf},

}

BACK TO COATI PUBLICATION INDEX

Last modified: Sat Jan 29 19:00:43 2022