Bibliographie par types (C. Delorme)

Le symbole permet de revenir à ce menu.
Le symbole permet de revenir à la tête du chapitre courant.

Ceci n'est qu'une page en cours de réalisation...

Articles

1974

  • Exemples de croissance de la cohomologie par spécialisation, Bulletin des Sciences Mathématiques 98 p. 29-38

    • 1975

  • Espaces projectifs anisotropes, Bulletin des Sciences Mathématiques 103 p. 203-223+510
  • Sur les modules des singularités des courbes planes CRAS 279 A p. 367-369
  • Sur la dimension d'un espace de singularités CRAS 280 A p. 1287-1289

    • 1976

  • Sous-monoïdes d'intersection complète de N, Ann. Sci. Ecole Norm. Sup. 9 p. 145-154

    • 1978

  • Sur les modules des singularités des courbes planes Bulletin des Sciences Mathématiques 106 p. 417-446

    • 1980

  • Two sets of graceful graphs, J. Graph Theory 4 p. 247-250
  • P. Assouad Graphes plongeables dans L1, CRAS 291 A p. 369-372
  • K.M. Koh, M. Mahéo, H.K Teo, H. Thuillier Cycles with a chord are graceful, J. Graph Theory 4 p. 409-415

    • 1981

  • Quelques remarques sur les courbes monomiales, Nova Acta Leopoldina 240 p. 95-101

    • 1982

  • J.-C. Bermond, G. Farhi Large graphs with given degree and diameter III, Ann. Discrete Math. 13 p. 23-32
  • J.-C. Bermond, J.-J. Quisquater Grands graphes non dirigés de degré et diamètre fixés, Ann. Discrete Math. 17 p. 65-73
  • J.-C. Bermond, J.-J. Quisquater Tables of large graphs with given degree and diameter, Inform. Process. Lett. 15 p. 10-13

    • 1984

  • J.-C. Bermond, G. Farhi Large graphs with given degree and diameter II, J. Combin. Theory Ser. B 36 p. 32-48
  • G. Farhi Large graphs with given degree and diameter I, IEEE Trans. Comput C-33 p. 857-860
  • G. Hahn Infinite generalized friendship graphs, Discrete Math. 49 p. 261-266

    • 1985

  • Grands graphes de degré et diamètre donnés, ejc 6 p. 291-302
  • J. Bond Large bipartite graphs with given degree and diameter J. Graph Theory 8 p. 325-334

    • 1986

  • J.-C. Bermond, J.-J. Quisquater Strategies for interconnection networks: some methods from graph theory, J. Parallel and Distributed Computing 3 p. 433--449

    • 1987

  • J. Bond New large bipartite graphs of given degree and diameter, Ars Combin. 25-C p. 123-132

    • 1991

  • P. Solé Diameter, covering index, covering radius and eigenvalues, European J. of Combin. 12 p. 95-108

    • 1992

  • O. Favaron, M. Mahéo Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups, European J. of Combin. 13 p. 59-61
  • Examples of products giving large graphs with given degree and diameter, Discrete Appl. Math. 37-38 p. 157-167
  • J.-C. Bermond, J.-J. Quisquater Table of large graphs with given degree and diameter, Discrete Appl. Math. 37-38 p. 575-577

    • 1993

  • Eigenvalues of finite graphs, Discrete Math. 114 p. 137-146
  • J. Bond A note on partial Cayley graphs, Discrete Math. 114 p.63-74
  • H. Comon A problem on matchings, Discrete Math. 111 p. 485 (Proceedings of a Problem Session at Marseille 1990, Problem 162}
  • S. Poljak The performance of an eigenvalue bound on the max-cut problem in some classes, Discrete Math. 111, p. 145-156 (Colloque at Marseilles 1990)
  • S. Poljak Laplacian eigenvalues and the maximum cut problem, Math. Programming 62 p. 557-574
  • S. Poljak Combinatorial properties and complexity of a max-cut approximation, European J. of Combin. 14 p. 313-333

    • 1994

  • Distance biregular bipartite graphs, European J. of Combin. 15 p. 223-238
  • Y. O. Hamidoune On product of sets in groups, Graphs and Combinatorics 10, p. 101-104

    • 1995

  • A. Bouabdallah, S. Djelloul Edge deletion preserving the diameter of the hypercube, Discrete applied Math. 63 p. 91-95

    • 1997

  • J.-P. Tillich Eigenvalues, eigenspaces and distances to subsets, Discrete Math. 165/166 p. 171-194

    1998

  • J.-P. Tillich The spectrum of de Bruijn and Kautz graphs, Europ. J. Combin. 19 p. 307-319
  • O. Ordaz, D. Quiroz Tools for studying paths and cycles in digraphs, Networks 31 p.125-148

    1999

  • Eigenvalues and weights of induced subgraphs, Publ. Inst. Math. (Beograd), NS 65(79) p. 20-30
  • Marie-Claude Heydemann A problem on walks, Ann. Instit. Fourier 49 p. 905-919
  • Fan Chung, P. Solé Multidiameters and multiplicities, Europ J. Combin. 20 p. 629-640
  • Odile Favaron Graphs with a small max-cut, Utilitas Math. 56 p. 153-165

    2001

  • Presentations of groups generated by transpositions, Disc. Math. 236 p. 59-64
  • O. Ordaz, D. Quiroz Some remarks on Davenport constant, Disc. Math. 237 p. 119-128

    2002

  • Spectra and Cuts, Australas. J. Combin. 46 p. 183-191
  • Odile Favaron, Dieter Rautenbach On the Randic index, Disc. Math. 257 p. 29-38
  • J. Gómez Some New Large Compound Graphs Europ. J. Combinatorics 23 p. 539-547
  • Odile Favaron, Dieter Rautenbach On the reconstruction of the degree sequence. Disc. Math. 259 p. 293-300

    2003

  • Odile Favaron, Dieter Rautenbach Close Formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Disc. Applied Math. 130 p. 503-512

    2004

  • Laplacian eigenvalues and fixed size multisections, Disc. Math. 276 p. 149-159
  • S. Gonzales, O. Ordaz, M. T. Varela Barycentric sequences and barycentric Ramsey numbers-stars. Disc. Math 277 p.45-56
  • I. Marquez, O. Ordaz, A. Ortuño Existence conditions for barycentric sequences. Disc. Math 281 p.163-172

    2007

  • D. M. Cardoso, P. Rama Laplacian eigenvectors and eigenvalues and almost equitable partitions. Europ J. Combin. 28 p. 665-673
  • Sur la formule d'inversion de Lagrange. Annales de la faculté des sciences de Toulouse Sér. 6, 16, p.247-252
  • I. Márquez, O. Ordaz, D. Quiroz Maximum line-free set geometry in Z3d. Divulgationes Matematicas 15 253-263

    2008

  • D. Cardoso, J. Orestes Cerdeira, P. da Silva Efficient edge domination in regular graphs. Disc. Applied Math. 156 3060-3065
  • J.-M. Rinkel About the generating function of a left-bounded integer-valued random variable. Bull. Soc. Math. France 136 565-573

    2009

  • L.K. Jørgensen and M. Miller and G. Pineda-Villavicencio, On bipartite graphs of diameter 3 and defect 2. Journal of Graph Theory 61 271-288
  • L.K. Jørgensen and M. Miller and G. Pineda-Villavicencio, On bipartite graphs with defect 2. European Journal of Combinatorics 30 798-808
  • E. Flandrin, Y. Lin, M. Miller, J. Ryan On extremal graphs with bounded girth, Electronic notes in Discrete Mathematics 34 p. 653-657

    2010

  • Plane trivalent trees and their patterns, Cent. Eur. J. Math. 8 p. 1041-1047
  • G. Pineda-VillavicencioOn Graphs with Cyclic Defect or Excess, Electronic J. of Combinatorics 17(1) R. 143

    2011

  • J. M. Rinkel Random walks on the nonnegative integers with a left-bounded generator, Probability and Mathematical Statistics 31.1 p. 119-139
  • Spectra and graph comparison, Publ. Inst. Mat. (Beograd) 90(104) p. 99-110

    • Proceedings

    1993

  • Quadratic forms and graph decomposition, in CODIGRAF'93 II col·loqui de combinatòria, codificació i teoria de grafs, Universitat Autònoma de Barcelona, España

    • 1994

  • Quadratic forms and graph decomposition, in VII Jornadas en teoria de grafos y sus aplicaciones, Universidad de Oriente, Venezuela (same content as the former item)
  • Dénombrement de circuits dans certains graphes de Cayley, in Journées sur les graphes de Cayley, Ecole Normale Supérieure de Lyon, Lyon

    • 1996

  • P. Panaite Rubik Routing Permutations on graphs, Europar '96
  • M. R. Brito, L. E. Marquez, O. Ordaz Virus for graph properties, Memorias de la XXII Conferencia Latinoamericana de Informatica, Santafe de Bogota, Colombia p. 347-358
  • M. R. Brito, L. E. Marquez, O. Ordaz Some results on virus theory, Proceedings of International Conference on Information Systems Analysis and Synthesis (ISAS'96), Orlando, USA p.  897-901
  • E. Bampis, J.-C. König Optimal Schedules for d-D grid graphs with communication delays, LNCS 1046, p. 655-666

    • 2011

  • Large edge-non-vulnerable graphs, Proceedings of IWONT 2010, p. 239-250
  • Eigenvalues of complete multipartite graphs, Proceedings of 8fcc

    Livres

    1976

  • et al. Exercices corrigés de Birkhoff MacLane, Gauthier Villars, Paris

    • 1982

  • A. Mézard, J.-P. Penot Manuel pour la classe de troisième, SERMAP Hatier, Paris

    • 1986

  • et al. Manuel pour les classes de Terminale C et E, Ellipses, Paris

    • 1987

  • et al. , Academia, Praha, (translation of Exercices corrigés)

    • 1993

  • A. Mézard Cours de Mathématiques supérieures, tome 1, Presses Universitaires de France, Paris

    • 1994

  • A. Mézard Cours de Mathématiques supérieures, tome 2, Presses Universitaires de France, Paris

    • 1998

  • Combinatoire: Aspects algébriques, Paris Onze Editions, vol. K160.

    Divers

    1983

  • Un théorème de coloration pour les groupes abéliens, Pub. Math. Orsay 83-01

    • 2006

  • J.-M. Rinkel Marches aléatoires Dissymétriques sur les entiers naturels Dept. Math. Prepub. june

    Rapports LRI

    1979

  • K. M. Koh, M. Mahéo, H. K. Teo, H. Thuillier Cycles with a chord are graceful 61

    • 1981

  • J.-C. Bermond, G. Farhi Large graphs with given degree and diameter III 104
  • J.-C. Bermond, G. Farhi Large graphs with given degree and diameter II 105
  • J.-C. Bermond, J.-J. Quisquater Grands graphes non dirigés de degré et diamètre donnés 113

    • 1982

  • G. Farhi Large graphs with given degree and diameter I 116
  • Grands graphes de degré et diamètre donnés 117
  • Large bipartite graphs with given degree and diameter 120

    • 1983

  • G. Hahn Infinite generalized friendship graphs 129
  • Régularité métrique forte 156

    • 1984

  • Two notes on large graphs 172

    • 1985

  • J.-C. Bermond, J.-J. Quisquater Strategies for interconnection networks: some methods from graph theory 227

    • 1986

  • J.-J. Quisquater Two notes on graphs and security 294
  • O. Favaron, M. Mahéo Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups 314
  • J.-J. Quisquater Some new compound graphs 317

    • 1987

  • Les valeurs propres des graphes finis 338
  • Graphes et hypergraphes sommets transitifs 383
  • J. Bond New large bipartite graphs of given degree and diameter 386
  • J. Bond A note on partial Cayley graphs 387
  • J. Bond, W. Fernandez de la Vega Large Cayley graphs with small degree and diameter 392

    • 1989

  • Calcul de l'indice de transmission de quelques graphes géodésiques 466
  • Construction de graphes possédant des routages de plus court chemin chargeant également les arêtes 482
  • Y. O. Hamidoune On product of sets in groups 519

    • 1990

  • A. Bouabdallah, S. Djelloul Edge deletion preserving the diameter of the hypercube 538
  • P. Solé Diameter, covering index, covering radius and eigenvalues 568
  • S. Poljak Laplacian eigenvalues and the maximum cut problem 599

    • 1991

  • S. Poljak Combinatorial properties and complexity of a max-cut approximation 680

    • 1993

  • D. F. Hsu On complete mappings of some groups 814

    • 1994

  • J. Gómez Some new large compound graphs 905
  • J. P. Tillich The spectrum of de Bruijn and Kautz graphs 943

    • 1995

  • M. Duran, O. Ordaz The zero-sum stars problem 965
  • P. Panaite Rubik routings: packet routings in a restricted communication model 966
  • A. Cammaroto, O. Ordaz Stars with null sum in graphs 985
  • W. Fernandez de la Vega, S. Gonzalez, O. Ordaz Barycentric Ramsey numbers 989
  • O. Ordaz, A. Ortuño Some existence results for barycentric subsets 990
  • J. P. Tillich Eigenvalues, eigenspaces and distances to subsets 997

    • 1996

  • O. Ordaz, D. Quiroz Virus a local configuration that prevents some graph property 1052
  • Two notes on optimized laplacian eigenvalues 1060
  • O. Ordaz, D. Quiroz Tools for studying paths and cycles in digraphs 1062

    • 1997

  • M.-R. Brito, L. E. Marques, O. Ordaz Virus for graph properties 97-07 Centro de Ingeniería de Software Y Systemas Facultad de Ciencias, Univ. Central de Venezuela
  • Isomorphisms of transposition graphs 1101
  • O. Favaron Graphs with a small max-cut 1102
  • O. Ordaz, D. Quiroz Some remarks on Davenport constant 1121

    • 1998

  • Marie-Claude Heydemann A problem on walks 1186

    • 1999

  • O. Favaron, D. Rautenbach On the Randic Index 1214
  • Spectre et coupes 1224

    • 2001

  • O. Favaron, D. Rautenbach Edge-reconstruction of degree-sequences of a graph 1272

    • 2002

  • J.L. Shu Upper bounds on the length of the longest induced cycle in graphs 1321

    • 2006

  • D. ForgeCounting closed and open walks 1454

    2007

  • Graphes, hypergraphes, droite projective, quaternions 1477

    2008


    cd@lri.fr
    last modif 10 dec. 2011