Publications of year 1984

1. J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. II. J. Combin. Theory Ser. B, 36(1):32--48, 1984.
   

   @article{MR742385,
   AUTHOR = {Bermond, J.-C. and Delorme, C. and Farhi, G.},
   TITLE = {Large graphs with given degree and diameter. {II}},
   JOURNAL = {J. Combin. Theory Ser. B},
   VOLUME = {36},
   YEAR = {1984},
   NUMBER = {1},
   PAGES = {32--48},
   ISSN = {0095-8956},
   
   }
   



2. J.-C. Bermond, J.-L. Fouquet, M. Habib, and B. Péroche. On linear $k$-arboricity. Discrete Math., 52(2-3):123--132, 1984.
   

   @article{MR772276,
   AUTHOR = {Bermond, J.-C. and Fouquet, J.-L. and Habib, M. and P{\'e}roche, B.},
   TITLE = {On linear {$k$}-arboricity},
   JOURNAL = {Discrete Math.},
   VOLUME = {52},
   YEAR = {1984},
   NUMBER = {2-3},
   PAGES = {123--132},
   ISSN = {0012-365X},
   
   }
   



3. J.-C. Bermond and M. Las Vergnas. Regular factors in nearly regular graphs. Discrete Math., 50(1):9--13, 1984.
   

   @article{MR747707,
   AUTHOR = {Bermond, J.-C. and Las Vergnas, M.},
   TITLE = {Regular factors in nearly regular graphs},
   JOURNAL = {Discrete Math.},
   VOLUME = {50},
   YEAR = {1984},
   NUMBER = {1},
   PAGES = {9--13},
   ISSN = {0012-365X},
   
   }
   



4. M. Hébert, P. Mussi, O. Faugeras, and J.-D. Boissonnat. Polyhedral Approximation of 3-D Objects without Holes. Computer Vision, Graphics, and Image Processing, 25, 1984.
   

   @ARTICLE{FHBM84,
   AUTHOR = {M. H\'ebert and P. Mussi and O. Faugeras and J.-D. Boissonnat},
   JOURNAL = {{Computer Vision, Graphics, and Image Processing}},
   TITLE = {{Polyhedral Approximation of 3-D Objects without Holes}},
   YEAR = {1984},
   VOLUME = 25 
   }
   

1. J.-C. Bermond, J. Bond, and J.-F. Saclé. Large hypergraphs of diameter $1$. In Graph theory and combinatorics (Cambridge, 1983), London, pages 19--28, 1984. Academic Press.
   

   @inproceedings{MR777161,
   AUTHOR = {Bermond, J.-C. and Bond, J. and Sacl{\'e}, J.-F.},
   TITLE = {Large hypergraphs of diameter {$1$}},
   BOOKTITLE = {Graph theory and combinatorics (Cambridge, 1983)},
   PAGES = {19--28},
   PUBLISHER = {Academic Press},
   ADDRESS = {London},
   YEAR = {1984},
   
   }
   



2. P. Mussi and P. Nain. Evaluation of Parallel Execution of Program Tree Structures. In ACM SIGMETRICS Conference on Measurement and Modeling, volume 12, August 1984. ACM.
   

   @inproceedings{MuNa84,
   author = {P. Mussi and P. Nain},
   booktitle = {ACM SIGMETRICS Conference on Measurement and Modeling},
   month = {August},
   publisher = {ACM},
   title = {Evaluation of Parallel Execution of Program Tree Structures},
   year = {1984},
   volume = 12,
   number = 3,
   location = {Cambridge, MA} 
   }
   

This document was translated from BibT_EX by bibtex2html