1  Avertissement

Ceci est la liste de publication déterminée par les fichiers .bib dont je dispose: on les trouve dans /users/graphe/atom/Biblio Ces fichiers sont attachés par des liens physiques ou symboliques à VOS fichiers de biblio.

Les deux façons de faire ces liens ont chacune leur inconvénient: les liens symboliques exigent pour être efficaces que le chemin d'accès au fichier référencé soit libre et ne change pas. Les liens en dur sont décrochés par emacs (qui crée un nouveau bloc pour le nouveau fichier et laisse la version de sauvegarde marquée d'un ~ sur l'ancien bloc), mais l'édition par wx convient parfaitement. En revanche on peut appliquer mv sans décrocher le lien en dur, et les droits du chemin (sauf bien sûr ceux du fichier lui-même) n'interviennent plus.

Pour plus de détails consultez la documentation sur ln. On ne consulte jamais assez la documentation.

Au cas où vous voudriez changer la nature du lien, veillez me prévenir et me donner le chemin de votre fichier .bib.

Si le résultat ne vous plaît pas, ce peut être souvent à cause de défauts de votre fichier. Consultez le fichier /users/graphe/atom/Biblio/Test.*.blg qui correspond à votre numéro: s'il n'est pas absent, c'est que votre fichier n'est pas impeccable. Consultez le manuel de LATEX, principalement l'appendice B.

Références

[1]
Ainouche A., O. Favaron, and H. Li. Global insertion and hamiltonicity in dct-graphs. Technical Report 955, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 3 1995.
[2]
A. Ainouche, O. Favaron, and H. Li. Global insertion and hamiltonicity in DCT-graphs. Discrete Math., 184:1–13, 1998.
[3]
A. Ainouche and M. Kouider. Hamiltonism and partially squared graphs. Graphs and combinatorics, 5, 1999. 257-265.
[4]
A. Ainouche and M. Kouider. Cycles in partially squared graphs. Graphs and Combinatorics, 17;1-9, 2001.
[5]
H. Akhbari, O. Favaron, H. Karami, and S.M. Sheikholeslami. Inequalities of Nordhaus-Gaddum type for doubly connected domination. Discrete Applied Math., 158:1465–1470, 2010.
[6]
D. Amar, M. El Kadi Abderrezzak, and E. Flandrin. Induced S(K1,3) and hamiltonian square. Internal Report 1148, LRI, 1998.
[7]
D. Amar, O. Favaron, P. Mago, and O. Ordaz. Biclosure and bistability in a balanced bipartite graph. J. Graph Theory, 20, no 4:513–529, 1995.
[8]
D. Amar, E. Flandrin, I. Fournier, and A. Germa. Degré minimum et cycles de longueur donnée. Internal Report 277, LRI, 1986.
[9]
D. Amar, E. Flandrin, Fournier I., and Germa A. Pancyclism in hamiltonian graphs. Disc. Math., 89:111–131, 1991.
[10]
C. Andrad, A. Lisser, G. Plateau, and N. Maculan. Simulation on the integer capacity planning under uncertain demand problem in telecommunication networks. In Annals of EUROSIM (CD-ROM) Delft, 2001.
[11]
C. Andrade, A. Lisser, G. Plateau, and N. Maculan. Telecommunication network capacity design for uncertain demand. Computational Optimization and Applications, 29:127–146, 2004.
[12]
C. Andrade, A. Lisser, G. Plateau, and N. Maculan. B&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty. Annals of Operations Research, 140:49–65, 2005.
[13]
C. Andrade, A. Lisser, G. Plateau, and N. Maculan. Enhancing a branch and bound algorithm for two-stage stochastic integer network design based models. Management Science, 52:49–65, 2006.
[14]
M. Aouchiche, O. Favaron, and P. Hansen. Recherche à voisinage variable de graphes extrémaux 26: Nouveaux résultats sur la maille. RAIRO-Operations research, 43(4):339–358, 2009.
[15]
M. Aouchiche, O. Favaron, and P. Hansen. Variable neighborhood search for extremal graphs 22: Extending bounds for independence to upper irredundance. Discrete Applied Math., 157(17):3497–3510, 2009.
[16]
H. Aram, S.M. Sheikholeslami, and O. Favaron. Domination subdivision numbers of trees. Discrete Math., 309(4):622–628, 2009.
[17]
S. Arumugam, O. Favaron, and S. Sudha. Irredundance saturation number of a graph. Australasian J. Combin., 46:37–49, 2010.
[18]
P. Assouad and C. Delorme. Graphes plongeables dans L1. C. R. Acad. Sci. Paris série A, 291:369–372, 1980.
[19]
J. Ayel and O. Favaron. Helms are graceful. In Progress in Graph Theory, Proceedings Waterloo 1982, pages 89–92. A. Bondy and U. Murty, Academic Press Canada, 1984.
[20]
G. Bacsó and O. Favaron. Independence, irredundance, degrees and chromatic number in graphs. Discrete Math., 259(1-3):257–262, 2002.
[21]
E. Bampis, C. Delorme, and J.-C. König. Optimal schedules for d-d grid graphs with communication delays. In 13th Annual Symposium on Theoretical Aspects of Computer Science, number 1046 in Lecture Notes in Computer Science, pages 655–666. Springer Verlag, 1996.
[22]
J Bang-Jensen, G. Gutin, and H Li. Sufficient conditions for a digraph to be hamiltonian. Journal of Graph Theory, 22(2):181–187, 1996.
[23]
D. Barraez, E. Flandrin, H. Li, and O. Ordaz. Dominating cycles in bipartite biclaw-free graphs. Disc. Math., 146:11–18, 1995.
[24]
D. Barraez, E. Flandrin, H. Li, and O. Ordaz. Dominating cycles in bipartite biclaw-free graphs. Discrete Mathematics, 146:11–18, 1995.
[25]
C. Bazgan, A. Harkat-Benhamdine, H. Li, and M Wozniak. On the vertex-distinguishing edge colorings of graphs. Technical Report 1129, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1997.
[26]
C. Bazgan, A. Harkat-Benhamdine, H. Li, and M Wozniak. Partitionning vertices of 1-tough graph into long paths. Technical Report 1136, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 11 1997.
[27]
C. Bazgan, H. Li, and M Wozniak. On the loebl-komlós-sós conjecture. Technical Report 1094, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1996.
[28]
S. Bekkaï, D. Forge, and M. Kouider. Covering the vertices of a graph by cycles of bounded length. Discrete Appl. Math. to appear.
[29]
W. Benajam, A. Caminida, and A. Lisser. Optimisation d'affectation de fréquences dans les réseaux mobiles. In ROADEF'03, Avignon, February 2003.
[30]
W. Benajam, A. Gaivoronski, and A.Lisser. Stochastic fap. In 10th international stochastic programming conference, Tuscon, Arizona, pages 50–51, 2004.
[31]
W. Benajam, A. Gaivoronski, and A. Lisser. Stochastic frequency assignment problem. In CIMODE'06, Guadeloupe, April 2006.
[32]
W. Benajam and A. Lisser. Relaxations linéaires et semidéfinies pour la résolution de problèmes d'affectation de fréquences. In CIRO, Marrakech, 2005.
[33]
W. Benajam and A. Lisser. Problème d'affectation de fréquences stochastique. In ROADEF, Lille, February 2006.
[34]
W. Benajam, A. Lisser, and M. Minoux. Quadratic assignment proble. In ROADEF, Tours, February 2005.
[35]
C. Bentz. The maximum integer multiterminal flow problem in directed graphs. Operations Research Letters, 35:195–200, 2007.
[36]
C. Bentz. On planar and directed multicuts with few source-sink pairs. In Proceedings of CTW 2009, Paris, France, 2007.
[37]
C. Bentz. On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics, 156:1908–1917, 2008.
[38]
C. Bentz. Disjoint paths in sparse graphs. Discrete Applied Mathematics, 157:3558–3568, 2009.
[39]
C. Bentz. New results on planar and directed multicuts. In Electronic Notes in Discrete Mathematics, Proceedings of EUROCOMB 2009, volume 34, pages 207–211, Bordeaux, France, 2009.
[40]
C. Bentz. A simple algorithm for multicuts in planar graphs with outer terminals. Discrete Applied Mathematics, 157:1959–1964, 2009.
[41]
C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, and B. Ries. On a graph coloring problem arising from discrete tomography. Networks, 51:256–267, 2008.
[42]
C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, and B. Ries. Degree-constrained edge partitioning in graphs arising from discrete tomography. Journal of Graph Algorithms and Applications, 13:99–118, 2009.
[43]
C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, and R. Zenklusen. Blockers and transversals. Discrete Mathematics, 309:4306–4314, 2009.
[44]
C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, and R. Zenklusen. d-bloqueurs et d-transversaux. In Proceedings of ROADEF 2009, Nancy, France, 2009.
[45]
C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, and R. Zenklusen. Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discrete Mathematics, 310:132–146, 2010.
[46]
C. Bentz, M.-C. Costa, N. Derhy, and F. Roupin. Cardinality constrained and multi-criteria (multi)cut problems. Journal of Discrete Algorithms, 7:102–111, 2009.
[47]
C. Bentz, M.-C. Costa, L. Létocart, and F. Roupin. Multicuts and integral multiflows in rings. European Journal of Operational Research, 196:1251–1254, 2009.
[48]
C. Bentz, M.-C. Costa, C. Picouleau, and M. Zrikem. The shortest multipaths problem in a capacitated dense channel. European Journal of Operational Research, 178:926–931, 2007.
[49]
C. Bentz, M.-C. Costa, and F. Roupin. Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. Journal of Discrete Algorithms, 5:36–54, 2007.
[50]
C. Bentz and C. Picouleau. Locally bounded k-colorings of trees. RAIRO-RO, 43:27–34, 2009.
[51]
Cédric Bentz and Pierre Le Bodic. Problèmes de coupe multiterminale partielle. In 12ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, 2011.
[52]
J.-C. Bermond, J. Bond, and S. Djelloul. Dense bus networks of diameter 2. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 21:9–18, 1995.
[53]
J.-C. Bermond, J. Bond, and J.-F. Saclé. Large hypergraphs of diameter 1. In Béla Bollobás, editor, Graph Theory and Combinatoric, pages 19–28. Acad. Press, 1984.
[54]
J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter II. Research report 105, LRI, 1981. Preliminary version of [57].
[55]
J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter III. Research report 104, LRI, 1981. Preliminary version of [56].
[56]
J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter III. Ann. Discrete Math., 13:23–32, 1982.
[57]
J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter II. J. Combin. Theory Ser. B, 36:32–48, 1984.
[58]
J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Grands graphes non dirigés de degré et diamètre donnés. Research report 113, LRI, 1981. Preliminary version of [59].
[59]
J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Grands graphes non dirigés de degré et diamètre fixés. Ann. Discrete Math., 17:65–73, 1982.
[60]
J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Tables of large graphs with given degree and diameter. Inform. Process. Lett., 15:10–13, 1982.
[61]
J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Strategies for interconnection networks: some methods from graph theory. Research report 227, LRI, 1985. Preliminary version of [62].
[62]
J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Strategies for interconnection networks: some methods from graph theory. J. of Parallel and Distributed Computing, 3:433–449, 1986.
[63]
J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Table of large graphs with given degree and diameter. Discrete Appl. Math., 37-38:575–577, 1992.
[64]
J.-C. Bermond, O. Favaron, and M. Mahéo. Hamiltonian decomposition of cayley graphs of degree 4. J. Combin. Theory Ser. B, 2:142–152, 1989.
[65]
J.-C. Bermond, O. Favaron, and M. Mahéo. Hamiltonian decomposition of Cayley graphs of degree 4. J. Combin. Theory Ser. B, 46 (2):142–153, 1989.
[66]
P. Berthome, L. Gastal, and A. Lisser. Robust routing in changing topologies. In L. Gouveia and C. Mourao, editors, International Network Optimization Conference, Lisbonne, Portugal, pages 603–608, 2005.
[67]
P. Berthomé, L. Gastal, and A. Lisser. Robust routing in changing topologies. to appear in Networks 2006.
[68]
P. Berthomé, L. Gastal, and A. Lisser. Robust shortest path. In Optimization 2004, Lisbonne, Portugal, 2004.
[69]
P. Berthomé, L. Gastal, and A. Lisser. Robust routing in changing topologies. In ALGOTEL 2005, pages 57–61, 2005. (taux d'acceptation 50%).
[70]
M. Blidia, M. Chellali, and O. Favaron. Independence and 2-domination in trees. Austral. J. Combin., 33:317–327, 2005.
[71]
M. Blidia, M. Chellali, and O. Favaron. Ratios of some domination parameters in graphs and claw-free graphs. In J. A. Bondy et al., editors, Graph Theory in Paris, pages 61–72. Trends Math., Birkhauser, Basel, 2007.
[72]
M. Blidia, M. Chellali, O. Favaron, and N. Meddah. On k-independence in graphs with emphasis on trees. Discrete Math., 307 no 17-18:2209–2216, 2007.
[73]
M. Blidia, M. Chellali, O. Favaron, and N. Meddah. Maximal k-independent sets in graphs. Discuss. Math. Graph Theory, 28:151–163, 2008.
[74]
M. Blidia, O. Favaron, and R. Lounes. Locating-domination, 2-domination and independence in trees. Australasian J. Combin., 42:309–316, 2008.
[75]
J. Bond and C. Delorme. Large bipartite graphs with given degree and diameter. J. Graph Theory, 8:325–334, 1985.
[76]
J. Bond and C. Delorme. New large bipartite graphs of given degree and diameter. Ars Combin., 25-C:123–132, 1987.
[77]
J. Bond and C. Delorme. New large bipartite graphs of given degree and diameter. Research report 386, LRI, 1987. Preliminary version of [76].
[78]
J. Bond and C. Delorme. A note on partial Cayley graphs. Research report 387, LRI, 1987. Preliminary version of [79].
[79]
J. Bond and C. Delorme. A note on partial Cayley graphs. Discrete Math., 114:63–74, 1993.
[80]
J. Bond, C. Delorme, and W. F. de la Vega. Large Cayley graphs with small degree and diameter. Research report 392, LRI, 1987.
[81]
A. Bondy and M. Kouider. Hamiltonian cycles of regular 2-connected graphs. Journal of Combinatorial Theory, 43 B:177–186, 1987.
[82]
F. Bonnans, A. Lisser, H. Mounir, and R. Rebai. Interior point methods for solving multicommodity flow problems with decomposition. In EURO XVI, Belgique, July 1998.
[83]
F. Bonnans, A. Lisser, H. Mounir, and R. Rebai. Résolution des problèmes de multiflots. In FRANCORO'98, Tunisie, March 1998.
[84]
A. Bouabdallah, C. Delorme, and S. Djelloul. Edge deletion preserving the diameter of the hypercube. Research report 538, LRI, 1990. Preliminary version of [85].
[85]
A. Bouabdallah, C. Delorme, and S. Djelloul. Edge deletion preserving the diameter of the hypercube. Discrete Appl. Math., 63:91–95, 1995.
[86]
A. Bouabdallah, C. Delorme, and S. Djelloul. Edge deletion preserving the diameter of the hypercube. Discrete Applied Mathematics, 63:91–95, 1995.
[87]
S. Brandt, O. Favaron, and Z. Ryjáček. Closure and stable hamiltonian properties in claw-free graphs. J. Graph Theory, 34 (1):30–41, 2000.
[88]
M. R. Brito, C. Delorme, L. E. Marquez, and O. Ordaz. Some results on virus theory. In Proceedings of International Conference on Information Systems Analysis and Synthesis (ISAS'96), Orlando, USA, pages 897–901, 1996.
[89]
M. R. Brito, C. Delorme, L. E. Marquez, and O. Ordaz. Virus for graph properties. In Memorias de la XXII Conferencia Latinoamericana de Informatica, Santafe de Bogota, Colombia, pages 347–358, 1996.
[90]
H. Broersma, H. Li, J. Li, F. Tian, and H.J. Veldman. Cycles through subsets with large degree sums. Discrete Mathematics, 171:43–54, 1997.
[91]
J. Brousek, O. Favaron, and Z. Ryjáček. Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discrete Math., 196(1-3):29–50, 1999.
[92]
K. Brys, M. Kouider, Z. Lonc, and M. Mahéo. Decomposition of multigraphs. Technical Report 1069, L.R.I., 1996.
[93]
K. Brys, M. Kouider, Z. Lonc, and M. Maheo. Decomposition of multigraphs. Discussiones Math and Graph Theory, 18:225–232, 1998.
[94]
K. Brys, M. Kouider, Z. Lonc, and M. Mahéo. Decomposition of multigraphs. Discussiones Mathematicae, 18:225–232, 1998.
[95]
M. Cai, O. Favaron, and H. Li. (2,k)−factor-critical graphs and toughness. Graphs Combin., 15:137–142, 1999.
[96]
M. Cai, Favaron. O., and H. Li. (2,k)-factor-critical graphs and toughness. Technical Report 1075, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1996.
[97]
A. Cammaroto, C. Delorme, and O. Ordaz. Stars with null sum in graphs. Research report 985, LRI, 1995.
[98]
D. Cardoso, J. Orestes Cerdeira, P. da Silva, and C. Delorme. Efficient edge domination in regular graphs. Discrete Appl. Math., 156:3060–3065, 2008.
[99]
D. M. Cardoso, C. Delorme, and P. Rama. Laplacian eigenvectors and eigenvalues and almost equitable partitions. European J. of Combin., 28:665–673, 2007.
[100]
P. Chardaire and A. Lisser. A primal simplex specialisation for solving non oriented multicommodity flow problems. Investigation Operativa, 5:117–152, 1996.
[101]
P. Chardaire and A. Lisser. Non-oriented multicommodity flow problems. In C.A. Floudas and P.M. Pardalos, editors, Encyclodedia of Optimization, volume 4, pages 92–97. Kluwer Academic Publisher, 2001.
[102]
P. Chardaire and A. Lisser. Minimum cost multicommodity flow. In M. Resende and P.M. Pardalos, editors, Handbook of Applied Optimization, pages 404–422. Kluwer Academic Publisher, 2002.
[103]
P. Chardaire and A. Lisser. Simplex and interior point specialization algorithms for solving non-oriented multicommodity flow problems. Operations Research, 50:260–276, 2002.
[104]
M. Chellali and O. Favaron. On k-star-forming sets in graphs. J. Combin. Math. Combin. Comput., 68:205–214, 2009.
[105]
M. Chellali, O. Favaron, A. Hansberg, and L. Volkmann. On the p-domination, the total domination and the connected domination numbers of graphs. J. Combin. Math. Combin. Comput., 73:65–75, 2010.
[106]
M. Chellali, O. Favaron, A. Hansberg, and L. Volkmann. k-domination and k-independence in graphs: a survey. Graphs and Combinatorics, to appear.
[107]
M. Chellali, O. Favaron, T. W. Haynes, and D. Raber. Ratios of some domination parameters in trees. Discrete Math., 308 (17):3879–3887, 2008.
[108]
C. Chen, A. Harkat-Benhamdine, and H. Li. Distance-dominating cycles in quasi claw-free graphs. Technical Report 1045, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1996.
[109]
J. Chifflet, A. Lisser, D. Tachat, and P. Tolla. Approached and exact projection methods for karmarkar's algorithm. In ORSA/TIMS, New York, October 1989.
[110]
J. Chifflet, A. Lisser, D. Tachat, and P. Tolla. Studies of projection methods for karmarkar's algorithm. In Euro X, Belgrade, June 1989.
[111]
J. Chifflet, A. Lisser, D. Tachat, and P. Tolla. Solving a large size multicommodity fow problems using karmarkar's algorithm. In IFORS , Athènes, June 90.
[112]
J. Chifflet, A. Lisser, and P. Tolla. Interior point methods for multicommodity flow problems. Perquisa Operacional, 15:63–76, 1994.
[113]
F.R.K. Chung, C. Delorme, and P. Solé. Multidiameters and multiplicities. European Journal of Combinatorics, 20:629–640, 1999.
[114]
E. Cockayne, O. Favaron, H. Li, and G. MacGillivray. A bound for the product of the independent domination numbers of a graph and its complement. Discrete Mathematics, 90:313–317, 1991.
[115]
E. J. Cockayne, O. Favaron, A. Finbow, and C. M. Mynhardt. Open irredundance and maximum degree in graphs. Discrete Math., 308 (23):5358–5375, 2008.
[116]
E. J. Cockayne, O. Favaron, W. Goddard, P. J. Grobler, and C. M. Mynhardt. Changing upper irredundance by edge addition. Discrete Math., 266(1-3):185–193, 2003.
[117]
E. J. Cockayne, O. Favaron, P. J. Grobler, C. M. Mynhardt, and J. Puech. Generalised Ramsey numbers with respect to classes of graphs. Ars Combin., 59:279–288, 2001.
[118]
E. J. Cockayne, O. Favaron, P. J. Grobler, C. M. Mynhardt, and J. Puech. Ramsey properties of generalised irredundant sets in graphs. Discrete Math., 231 (1-3):123–134, 2001.
[119]
E. J. Cockayne, O. Favaron, H. Li, and G. MacGillivray. The product of the independent domination numbers of a graph and its complement. Discrete Math., 90:313–317, 1991.
[120]
E. J. Cockayne, O. Favaron, and C. M. Mynhardt. Universal maximal packing functions of graphs. Discrete Math., 159:57–68, 1996.
[121]
E. J. Cockayne, O. Favaron, and C. M. Mynhardt. Irredundance-edge-removal-critical graphs. Utilitas Math., 60:219–228, 2001.
[122]
E. J. Cockayne, O. Favaron, and C. M. Mynhardt. Total domination in claw-free cubic graphs. J. Combin. Math. Combin. Comput., 43:219–225, 2002.
[123]
E. J. Cockayne, O. Favaron, and C. M. Mynhardt. Secure domination, weak roman domination and forbidden subgraphs. Bull. Inst. Combin. Appl., 39:87–100, 2003.
[124]
E. J. Cockayne, O. Favaron, and C. M. Mynhardt. On i−-Edge-Removal-critical graphs. Discrete Math., 276(1-3):111–125, 2004.
[125]
E. J. Cockayne, O. Favaron, and C. M. Mynhardt. Total domination in Kr-covered graphs. Ars Combin., 71:289–303, 2004.
[126]
E. J. Cockayne, O. Favaron, C. M. Mynhardt, and J. Puech. An inequality chain of domination parameters for trees. Discussiones Mathematicae-Graph Theory, 18:127–142, 1998.
[127]
E. J. Cockayne, O. Favaron, C. M. Mynhardt, and J. Puech. Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. Austral. J. Combin., 18:253–262, 1998.
[128]
E. J. Cockayne, O. Favaron, C. M. Mynhardt, and J. Puech. A characterisation of (γ −i)-trees. J. Graph Theory, 34 (4):277–292, 2000.
[129]
E. J. Cockayne, O. Favaron, C. Payan, and A. G. Thomason. Contributions to the theory of domination, independence, and irredundance in graphs. Discrete Math., 33:249–258, 1981.
[130]
H. Comon and C. Delorme. A problem on matchings. Discrete Math., 111:485, 1993. Proceedings of a Problem Session at Marseille 1990, Problem 162.
[131]
R. Cordovil and D. Forge. Diagonal bases in Orlik-Solomon type algebras. Annals of Combinatorics, 7:247–257, 2003.
[132]
N. Dean and M. Kouider. Gallai's conjecture in disconnected graphs. Discrete Maths, 213(issue 1-3):43–54, 2000.
[133]
B. Decocq and A. Lisser. Interconnexion d'anneaux sdh. In FRANCORO'98, Tunisie, March 1998.
[134]
B. Decocq and A. Lisser. Direct and decomposition methods for multicommodity flow problems. In 4th International Conference of OR, LaHavane, Cuba, March 2000.
[135]
C. Delorme. Exemples de croissance de la cohomologie par spécialisation. Bull. Sci. Math., 98:29–38, 1974.
[136]
C. Delorme. Espaces projectifs anisotropes. Bull. Soc. Math. France, 103:203–223+510, 1975.
[137]
C. Delorme. Sur la dimension d'un espace de singularités. C. R. Acad. Sci. Paris série A, 280:1287–1289, 1975.
[138]
C. Delorme. Sur les modules des singularités des courbes planes. C. R. Acad. Sci. Paris série A, 279:367–369, 1975.
[139]
C. Delorme. Sous-monoïdes d'intersection complète de N. Ann. Sci. Ecole Norm. Sup., 9:145–154, 1976.
[140]
C. Delorme. Sur les modules des singularités des courbes planes. Bull. Soc. Math. France, 106:417–446, 1978.
[141]
C. Delorme. Two sets of graceful graphs. J. Graph Theory, 4:247–250, 1980.
[142]
C. Delorme. Quelques remarques sur les courbes monomiales. Nova Acta Leopoldina, 240:95–101, 1981.
[143]
C. Delorme. Grands graphes de degré et diamètre donnés. Research report 117, LRI, 1982. Preliminary version of [148].
[144]
C. Delorme. Large bipartite graphs with given degree and diameter. Research report 120, LRI, 1982. Preliminary version of [75].
[145]
C. Delorme. Régularité métrique forte. Research report 156, LRI, 1983. Preliminary version of [158].
[146]
C. Delorme. Un théorème de coloration pour les groupes abéliens. Pub. Math. Orsay, 83-01, 1983.
[147]
C. Delorme. Two notes on large graphs. Research report 172, LRI, 1984.
[148]
C. Delorme. Grands graphes de degré et diamètre donnés. European J. of Combin., 6:291–302, 1985.
[149]
C. Delorme. Graphes et hypergraphes sommets-transitifs. Research report 383, LRI, 1987.
[150]
C. Delorme. Les valeurs propres des graphes finis. Research report 338, LRI, 1987. Preliminary version of [155].
[151]
C. Delorme. Calcul de l'indice de transmission de quelques graphes géodésiques. Research report 466, LRI, 1989.
[152]
C. Delorme. Compter les chemins fermés dans un arbre. Research report 516, LRI, 1989.
[153]
C. Delorme. Construction de graphes possédant des routages de plus court chemin chargeant également les arêtes. Research report 482, LRI, 1989.
[154]
C. Delorme. Examples of products giving large graphs with given degree and diameter. Discrete Appl. Math., 37-38:157–167, 1992.
[155]
C. Delorme. Eigenvalues of finite graphs. Discrete Math., 114:137–146, 1993.
[156]
C. Delorme. Quadratic forms and graph decomposition. In Codigraf'93. Universitat Politècnica de Catalunya, Spain, 1993.
[157]
C. Delorme. Dénombrement de circuits dans certains graphes de Cayley. In Journées sur les graphes de Cayley, pages 103–111. Ecole Normale Supérieure de Lyon, 1994.
[158]
C. Delorme. Distance biregular bipartite graphs. European J. of Combin., 15:223–238, 1994.
[159]
C. Delorme. Quadratic forms and graph decomposition. In VII Jornadas en teoria de grafos y sus aplicaciones. Universidad de Oriente, Venezuela, 1994. same content as [156].
[160]
C. Delorme. Two notes on optimized laplacian eigenvalues. Research report 1060, LRI, 1996.
[161]
C. Delorme. Isomorphisms of transposition graphs. Research report 1101, LRI, 1997.
[162]
C. Delorme. Combinatoire : Aspects algébriques, volume K160. Paris Onze Edition, 1998.
[163]
C. Delorme. Eigenvalues and weights of induced subgraphs. Publ. Inst. Mat. (Beograd), 65(79):20–30, 1999.
[164]
C. Delorme. Spectre et coupes. Technical Report 1224, LRI, 1999. Preliminary version of [166].
[165]
C. Delorme. Presentations of groups generated by transpositions. Discrete Math., 236:59–64, 2001.
[166]
C. Delorme. Spectra and cuts. Australas. J. Combin., 26:183–191, 2002.
[167]
C. Delorme. Laplacian eigenvalues and fixed size multisections. Discrete Math., 276:149–159, 2004.
[168]
C. Delorme. Graphes, hypergraphes, droite projective, quaternions. Technical Report 1477, LRI, 2007.
[169]
C. Delorme. Sur la formule d'inversion de Lagrange. Annales de la faculté des sciences de Toulouse Sér. 6, 16(2):247–252, 2007.
[170]
C. Delorme. Plane trivalent trees and their patterns. Central European Journal of mathematics, 8:1041–1047, 2010.
[171]
C. Delorme. Eigenvalues of complete multipartite graphs, 2011. doi:10.1016/j.disc.2011.07.018.
[172]
C. Delorme. Large edge-non-vulnerable graphs. In J. M. Brunat, J. Fábrega, and J. Širáň, editors, Proceedings of IWONT 2010, pages 239–250. Universitat Politècnica de Catalunya, 2011.
[173]
C. Delorme. Spectra and graph comparison. Publ. Inst. Mat. (Beograd), 90(104):99, 2011.
[174]
C. Delorme, W. Fernandez de la Vega, S. Gonzalez, and O. Ordaz. Barycentric Ramsey numbers. Research report 989, LRI, 1995.
[175]
C. Delorme, M. Duran, and O. Ordaz. The zero-sum stars problem. Research report 965, LRI, 1995.
[176]
C. Delorme et al. Exercices corrigés de Birkhoff MacLane. Gauthier Villars, 1976.
[177]
C. Delorme et al. Manuel pour les classes de Terminale C et E. Ellipses, 1986. sous la direction de P. Sauser.
[178]
C. Delorme et al. Rozpracovaná řešení ùloh zvyšší algebry. Academia, Praha, 1987. translation of [176].
[179]
C. Delorme and G. Farhi. Large graphs with given degree and diameter I. Research report 116, LRI, 1982. Preliminary version of [180].
[180]
C. Delorme and G. Farhi. Large graphs with given degree and diameter I. IEEE Trans. Comput, C-33:857–860, 1984.
[181]
C. Delorme and O. Favaron. Graphs with a small max-cut. Utilitas Mathematica, 56:153–165, 1999.
[182]
C. Delorme and O. Favaron. Graphs with a small max-cut. Util. Math., 56:153–165, 1999.
[183]
C. Delorme, O. Favaron, and M. Mahéo. Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. Research report 314, LRI, 1986. Preliminary version of [184].
[184]
C. Delorme, O. Favaron, and M. Mahéo. Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. European J. of Combin., 13:59–61, 1992.
[185]
C. Delorme, O. Favaron, and M. Mahéo. Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. European J. of Combin., 13:59–61, 1992.
[186]
C. Delorme, O. Favaron, and M. Mahéo. Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. European J. Combin., 13:59–61, 1992.
[187]
C. Delorme, O. Favaron, and D. Rautenbach. On the Randić index. Technical Report 1214, LRI, 1999. Preliminary version of [189].
[188]
C. Delorme, O. Favaron, and D. Rautenbach. Edge-reconstruction of degree-sequences of a graph. Technical Report 1272, LRI, 2001. Preliminary version of [191].
[189]
C. Delorme, O. Favaron, and D. Rautenbach. On the Randić index. Discrete Math., 257(1):29–38, 2002.
[190]
C. Delorme, O. Favaron, and D. Rautenbach. On the Randić index. Discrete Math., 257(1):29–38, 2002.
[191]
C. Delorme, O. Favaron, and D. Rautenbach. On the reconstruction of the degree sequence. Discrete Math., 259((1-3)):293–300, 2002.
[192]
C. Delorme, O. Favaron, and D. Rautenbach. Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discrete Appl. Math., 130:503–512, 2003.
[193]
C. Delorme and Odile Favaron. Graphs with a small max-cut. Research report 1102, LRI, 1997.
[194]
C. Delorme, E. Flandrin, Y. Lin, M. Miller, and J. Ryan. On extremal graphs with bounded girth. Electronic notes in Discrete Mathematics, 34:653–657, 2009.
[195]
C. Delorme and D. Forge. Counting closed and open walks. Technical Report 1454, LRI, 2006.
[196]
C. Delorme and J. Gómez. Some new large compound graphs. Research report 905, LRI, 1994. Preliminary version of [197].
[197]
C. Delorme and J. Gómez. Some new large compound graphs. European J. of Combin., 23(5):539–547, 2002.
[198]
C. Delorme, S. Gonzales, O. Ordaz, and M. T. Varela. Barycentric sequences and barycentric Ramsey numbers-stars. Discrete Math., 277:45–56, 2004.
[199]
C. Delorme and G. Hahn. Infinite generalized friendship graphs. Research report 129, LRI, 1983. Preliminary version of [200].
[200]
C. Delorme and G. Hahn. Infinite generalized friendship graphs. Discrete Math., 49:261–266, 1984.
[201]
C. Delorme and Y. O. Hamidoune. On product of sets in groups. Research report 519, LRI, 1989. Preliminary version of [202].
[202]
C. Delorme and Y. O. Hamidoune. On product of sets in groups. Graphs Combin., 10:101–104, 1994.
[203]
C. Delorme and M.-C. Heydemann. On a problem of walks. Research report 1186, LRI, 1998. Preliminary version of [204].
[204]
C. Delorme and M.-C. Heydemann. On a problem of walks. Ann. Inst. Fourier, Grenoble, 49:905–919, 1999.
[205]
C. Delorme and D. F. Hsu. On complete mappings of some groups. Research report 814, LRI, 1993.
[206]
C. Delorme, L.K. Jørgensen, M. Miller, and G. Pineda-Villavicencio. On bipartite graphs of diameter 3 and defect 2. Journal of Graph Theory, 61:271–288, 2009.
[207]
C. Delorme, L.K. Jørgensen, M. Miller, and G. Pineda-Villavicencio. On bipartite graphs with defect 2. European Journal of Combinatorics, 30:798–808, 2009.
[208]
C. Delorme, K. M. Koh, M. Mahéo, H. K. Teo, and H. Thuillier. Cycles with a chord are graceful. Research report 61, LRI, 1979. Preliminary version of [209].
[209]
C. Delorme, K. M. Koh, M. Mahéo, H. K. Teo, and H. Thuillier. Cycles with a chord are graceful. J. Graph Theory, 4:409–415, 1980.
[210]
C. Delorme, K.M. Koh, M. Mahéo, H.K. Teo, and H. Thuillier. Cycles with a chord are graceful. J. Graph Theory, 4:409–415, 1980.
[211]
C. Delorme, I. Marquez, O. Ordaz, and A. Ortuño. Existence conditions for barycentric sequences. Discrete Math., 281:163–172, 2004.
[212]
C. Delorme, I. Márquez, O. Ordaz, and D. Quiroz. Maximum line-free set geometry in Z3d. Divulgationes Mathemáticas, 15:253–263, 2007.
[213]
C. Delorme and A. Mézard. Cours de Mathématiques supérieures, tome 1. Presses Universitaires de France, 1993.
[214]
C. Delorme and A. Mézard. Cours de Mathématiques supérieures, tome 2. Presses Universitaires de France, 1994.
[215]
C. Delorme, A. Mézard, and J.-P. Penot. Manuel pour la classe de troisième. SERMAP Hatier, 1982.
[216]
C. Delorme, O. Ordaz, and A. Ortuño. Some existence conditions for barycentric subsets. Research report 990, LRI, 1995. Preliminary version of [211].
[217]
C. Delorme, O. Ordaz, and D. Quiroz. Tools for studying paths and cycles in digraphs. Research report 1062, LRI, 1996. Preliminary version of [220].
[218]
C. Delorme, O. Ordaz, and D. Quiroz. Virus a local configuration that prevents some graph property. Research report 1052, LRI, 1996.
[219]
C. Delorme, O. Ordaz, and D. Quiroz. Some remarks on Davenport constant. Research report 1121, LRI, 1997. Preliminary version of [221].
[220]
C. Delorme, O. Ordaz, and D. Quiroz. Tools for studying paths and cycles in digraphs. Networks, 31:125–148, 1998.
[221]
C. Delorme, O. Ordaz, and D. Quiroz. Some remarks on Davenport constant. Discrete Math., 237:119–128, 2001.
[222]
C. Delorme and P. Panaite. Rubik routings: packet routings in a restricted communication model. Research report 966, LRI, 1995. Preliminary version of [223].
[223]
C. Delorme and P. Panaite. Rubik routing permutations on graphs. In Europar '96 Proceedings, number 1123 in Lecture Notes in Computer Science, pages 283–286. Springer Verlag, 1996.
[224]
C. Delorme and G. Pineda-Villavicencio. On graphs with cyclic defect or excess. Electronic J. of Combinatorics, 17(1)(R.143), 2010.
[225]
C. Delorme and S. Poljak. Laplacian eigenvalues and the maximum cut problem. Research report 599, LRI, 1990. Preliminary version of [228].
[226]
C. Delorme and S. Poljak. Combinatorial properties and complexity of a max-cut approximation. Research report 680, LRI, 1991. Preliminary version of [227].
[227]
C. Delorme and S. Poljak. Combinatorial properties and complexity of a max-cut approximation. European J. of Combin., 14:313–333, 1993.
[228]
C. Delorme and S. Poljak. Laplacian eigenvalues and the maximum cut problem. Math. Programming, 62:557–574, 1993.
[229]
C. Delorme and S. Poljak. The performance of an eigenvalue bound on the max-cut problem in some classes. Discrete Math., 111:145–156, 1993. Colloque at Marseilles 1990.
[230]
C. Delorme and J.-J. Quisquater. Some new compound graphs. Research report 317, LRI, 1986.
[231]
C. Delorme and J.-J. Quisquater. Two notes on graphs and security: I secrecy on identity of sender and addressee II keys exchanges. Research report 294, LRI, 1986.
[232]
C. Delorme and J.-M. Rinkel. Marches aléatoires dissymétriques sur les entiers naturels. prṕublication, Dept. Math. Univ. Paris-Sud, June 2006.
[233]
C. Delorme and J.-M. Rinkel. About the generating function of a left-bounded integer-valued random variable. Bull. Soc. Math. France, 136:565–573, 2008.
[234]
C. Delorme and J.-M. Rinkel. Random walks on the nonnegative integers with a left-bounded generator. Probability and Mathematical Statistics, 31:119–139, 2011.
[235]
C. Delorme and J.L. Shu. Upper bounds on the length of the longest induced cycle in graphs. Technical Report 1321, LRI, 2002.
[236]
C. Delorme and P. Solé. Diameter, covering index, covering radius and eigenvalues. Research report 568, LRI, 1990. Preliminary version of [237].
[237]
C. Delorme and P. Solé. Diameter, covering index, covering radius and eigenvalues. European J. of Combin., 12:95–108, 1991.
[238]
C. Delorme and J.-P. Tillich. The spectrum of de Bruijn and Kautz graphs. Research report 943, LRI, 1994. Preliminary version of [241].
[239]
C. Delorme and J.-P. Tillich. Eigenvalues, eigenspaces and distances to subsets. Research report 997, LRI, 1995. Preliminary version of [240].
[240]
C. Delorme and J.-P. Tillich. Eigenvalues, eigenspaces and distances to subsets. Discrete Math., 165/166:171–194, 1997.
[241]
C. Delorme and J.-P. Tillich. The spectrum of de Bruijn and Kautz graphs. European J. of Combin., 19:307–319, 1998.
[242]
X. Deng, H. Li, and Y. Zhu. Implicit-degrees and circumferences. Graph and Combinatorics, (5):283–290, 1989.
[243]
S. Djelloul. Etude de certains Réseaux d'Interconnexion : Structure et Communications. Doctorat en informatique, 1993. numero d'ordre : 2736.
[244]
S. Djelloul. Broadcasting in m-dimensional grid graphs with a given neighborhood template. Discrete Applied Mathematics, 53:25–36, 1994.
[245]
S. Djelloul and O. Favaron. On distances and eccentricities in the shuffle-exchange network. Technical report. Rapport interne LRI, numéro 910, 1994.
[246]
S. Djelloul and M. Kouider. On weighted mean distance. Australasian Journal of Combinatorics, 23:181–195, 2001.
[247]
S. Djelloul and M. Kouider. On weighted mean distance. Australasian Journal of Comb., 23:181–195, 2001.
[248]
S. Djelloul and M. Kouider. Minimum survivable graphs with bounded distance increase. Discrete Mathematics and Theoretical Computer Science, 6(1):123–132, 2003.
[249]
M. El Kadi Abderrezzak, E. Flandrin, A. Harkat-Benhamdine, and H. Li. Dλ-cycles in λ-claw-free graphs. Disc. Math., 165-166:11–20, 1997.
[250]
M. Elkadi-Abderrezzak, E Flandrin, A. Harkat-Benhamdine, and H. Li. dλ-cycles in λ-claw-free graphs. Discrete Mathematics, 165/166:12–20, 1997.
[251]
H. Enomoto, A. Kaneko, M. Kouider, and Zs. Tuza. Degree sums and covering cycles. Journal of Graph Theory, 20(13):419–422, 1995.
[252]
P. Chardaire et A. Lisser. Simplex and interior point specialization algorithms for solving non-oriented multicommodity flow problems. In ISMP'97, Lausanne, August 1997.
[253]
R. Faudree, O. Favaron, E. Flandrin, and H. Li. The complete closure of a graph. J. of Graph Th., 17:481–494, 1993.
[254]
R. Faudree, O. Favaron, E. Flandrin, and H. Li. Pancyclism and small cycles in graphs. Discussiones Mathematicae-Graph Theory, 16:27–40, 1996.
[255]
R. Faudree, O. Favaron, and H. Li. Independence, domination, irredundance and forbidden pairs. JCMCC, to appear.
[256]
R. J. Faudree, O. Favaron, E. Flandrin, and H. Li. The complete closure of a graph. J. Graph Theory, 17, no 4:481–494, 1993.
[257]
R. J. Faudree, O. Favaron, E. Flandrin, and H. Li. Pancyclism and small cycles in graphs. Discussiones Mathematicae-Graph Theory, 16:27–40, 1996.
[258]
R. J. Faudree, O. Favaron, E. Flandrin, H. Li, and Z. Liu. On 2-factors in claw-free graphs. Discrete Math., 206 (1-3):131–137, 1999.
[259]
R. J. Faudree, O. Favaron, and H. Li. Independence, domination, irredundance, and forbidden pairs. J. Combin. Math. Combin. Comput., 26:193–212, 1998.
[260]
R.J. Faudree, E. Flandrin, M.S. Jacobson, J. Lehel, and R.H. Schelp. Even cycles in graphs with many odd cycles. Internal Report 1147, LRI, 1998.
[261]
O. Favaron. Very well covered graphs. Discrete Math., 42:177–187, 1982.
[262]
O. Favaron. On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. J. Combin. Theory Ser. B, 39 (1):101–102, 1985.
[263]
O. Favaron. Equimatchable factor-critical graphs. J. Graph Theory, 10 (4):439–448, 1986.
[264]
O. Favaron. Stabilité, domination, irredondance et autres paramètres de graphes. Thèse d'Etat, Université Paris-Sud, Orsay, France, 1986.
[265]
O. Favaron. Stability, domination and irredundance in a graph. J. Graph Theory, 10 (4):429–438, 1986.
[266]
O. Favaron. k-domination and k-independence in graphs. Ars Combin., 25 C:159–167, 1988.
[267]
O. Favaron. A note on the open irredundance in a graph. Congr. Numer., 66:316–318, 1988.
[268]
O. Favaron. Two relations between the parameters of independence and irredundance in a graph. Discrete Math., 70:17–20, 1988.
[269]
O. Favaron. A bound on the independence domination number of a tree. International Journal of Graph Theory, 1, No 1:19–27, 1992.
[270]
O. Favaron. A note on the irredundance number after vertex-deletion. Discrete Math., 121:51–54, 1993.
[271]
O. Favaron. Least domination in a graph. Discrete Math., 150:115–122, 1996.
[272]
O. Favaron. On k - factor-critical graphs. Discussiones Mathematicae-Graph Theory, 16:41–51, 1996.
[273]
O. Favaron. Signed domination in regular graphs. Discrete Math., 158:287–293, 1996.
[274]
O. Favaron. Irredundance in inflated graphs. J. Graph Theory, 28(2):97–104, 1998.
[275]
O. Favaron. Extendability and factor-criticality. Discrete Math., 213 (1-3):115–122, 2000.
[276]
O. Favaron. From irredundance to annihilation: a brief overview of some domination parameters of graphs. Saber (Venezuela), 32 (2):64–69, 2000.
[277]
O. Favaron. Inflated graphs with equal independence number and upper irredundance number. Discrete Math., 236 (1-3):81–94, 2001.
[278]
O. Favaron. Independence and upper irredundance in claw-free graphs. Discrete Appl. Math., 132(1-3):85–95, 2003.
[279]
O. Favaron. An alternative definition of the k-irredundance. AKCE J. Graphs Comb., 2(1):33–38, 2005.
[280]
O. Favaron. Bounds on total and paired domination in graphs and claw-free graphs. In Proceedings Erster Aachener Tag der Graphentheorie 2004,, pages 59–73. Rheinisch-Westfälische Tech. Hochsch. Lehrstuhl II Math., Aachen, 2005.
[281]
O. Favaron. Global alliances and independence domination in some classes of graphs. Electronic J. Combinatorics, 15 (1):R 123, 2008.
[282]
O. Favaron. Bounds on the upper k-domination number and the k-star-forming number of a graph. JCMCC, to appear.
[283]
O. Favaron, E. Flandrin, H. Li, and Tian F. An Ore-type condition for pancyclability. ???, ??:????, 199???
[284]
O. Favaron, E. Flandrin, H. Li, Y. Liu, F. Tian, and Z. Wu. Sequences, claws and cyclability of graphs. J. of Graph Th., 21:357–369, 1996.
[285]
O. Favaron, E. Flandrin, H. Li, Y. Liu, F Tian, and Z. Wu. Sequences, claws and cyclability of graphs. Journal of Graph Theory, 21(4):357–369, 1996.
[286]
O. Favaron, E. Flandrin, H. Li, and Z. Ryjacek. Shortest walks in almost claw-free graphs. Ars Combinatoria, to appear.
[287]
O. Favaron, E. Flandrin, H. Li, and Z. Ryjáček. Shortest walks in almost claw free graphs. Ars Combinatoria, 42:223–232, 1996.
[288]
O. Favaron, E. Flandrin, H. Li, and Z. Ryjáček. Shortest walks in almost claw-free graphs. Ars Combin., 42:223–232, 1996.
[289]
O. Favaron, E. Flandrin, H. Li, and Z. Ryjáček. Clique covering and degree conditions for hamiltonicity in claw-free graphs. Discrete Math., 236 (1-3):65–80, 2001.
[290]
O. Favaron, E. Flandrin, H. Li, and F. Tian. An Ore-type condition for pancyclability. Discrete Math., 206 (1-3):139–144, 1999.
[291]
O. Favaron, E. Flandrin, H. Li, and F. Tian. An ore-type condition for pancyclability. Discrete Mathematics, to appear.
[292]
O. Favaron, E. Flandrin, and Z. Ryjacek. Factor-criticality and matching extension in DCT-graphs. Discussiones Mathematicae-Graph Theory, to appear.
[293]
O. Favaron, E. Flandrin, and Z. Ryjáček. Factor-criticality and matching extension in DCT-graphs. Discussiones Mathematicae-Graph Theory, 17:271–278, 1997.
[294]
O. Favaron and J.-L. Fouquet. On m-centers in Pt-free graphs. Discrete Math., 125:147–152, 1994.
[295]
O. Favaron and P. Fraisse. Hamiltonicity and minimum degree in 3-connected claw-free graphs. J. Combin. Theory Ser. B, 82 (2):297–305, 2001.
[296]
O. Favaron, G. Fricke, W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi, P. Kristiansen, R. C. Laskar, and D. Skaggs. Offensive alliances in graphs. Discuss. Math. Graph Theory, 24:263–275, 2004.
[297]
O. Favaron, G. H. Fricke, D. Pritikin, and J. Puech. Irredundance and domination in kings graphs. Discrete Math., 262(1-3):131–147, 2003.
[298]
O. Favaron, F. Genest, and M. Kouider. Regular path decomposition of odd regular graphs. J. Graph Theory, 2(63):114–128, 2010.
[299]
O. Favaron, A. Hansberg, and L. Volkmann. k-domination and minimum degree in graphs. J. Graph Theory, 57 no 1:33–40, 2008.
[300]
O. Favaron and B. Hartnell. On well-k-covered graphs. J. Combin. Math. Combin. Comput., 6:199–205, 1989.
[301]
O. Favaron, T. W. Haynes, and S. T. Hedetniemi. Domination subdivision in graphs. Utilitas Math., 66:195–209, 2004.
[302]
O. Favaron, T. W. Haynes, S. T. Hedetniemi, M. A. Henning, and D. J. Knisley. Total irredundance in graphs. Discrete Math., 256(1-2):115–127, 2002.
[303]
O. Favaron, T. W. Haynes, and P. J. Slater. Distance-k independent domination sequences. J. Combin. Math. Combin. Comput., 33:225–237, 2000.
[304]
O. Favaron, S. T. Hedetniemi, S. M. Hedetniemi, and D. F. Rall. On k-dependent domination. Discrete Math., 249(1-3):83–94, 2002.
[305]
O. Favaron and M. A. Henning. Upper total domination in claw-free graphs. J. Graph Theory, 44(2):148–158, 2003.
[306]
O. Favaron and M. A. Henning. Paired domination in claw-free cubic graphs. Graphs Combin., 20(4):447–456, 2004.
[307]
O. Favaron and M. A. Henning. Bounds on total domination in claw-free cubic graphs. Discrete Math., 308 (16):3491–3507, 2008.
[308]
O. Favaron and M. A. Henning. Total domination in claw-free graphs with minimum degree two. Discrete Math., 308 (15):3213–3219, 2008.
[309]
O. Favaron, M. A. Henning, C. M. Mynhardt, and J. Puech. Total domination in graphs with minimum degree three. J. Graph Theory, 34 (1):9–19, 2000.
[310]
O. Favaron, M. A. Henning, J. Puech, and D. Rautenbach. On domination and annihilation in graphs with claw-free blocks. Discrete Math., 231 (1-3):143–151, 2001.
[311]
O. Favaron, M.-C. Heydemann, J.-C. Meyer, and D. Sotteau. A parameter linked with g-factors and the binding number. Discrete Math., 91:311–316, 1991.
[312]
O. Favaron, V. Kabanov, and J. Puech. The ratio of three domination parameters in some classes of claw-free graphs. J. Combin. Math. Combin. Comput., 31:151–159, 1999.
[313]
O. Favaron, H. Karami, R. Khoeilar, and S.M. Sheikholeslami. A new bound on the total domination subdivision numbers. Graphs Combin., 25 (1):41–47, 2009.
[314]
O. Favaron, H. Karami, R. Khoeilar, and S.M. Sheikholeslami. On the roman domination number of a graph. Discrete Math., 10:3447–3451, 2009.
[315]
O. Favaron, H. Karami, R. Khoeilar, and S.M. Sheikholeslami. On the total domination subdivision number in some classes of graphs. J. Combin. Optim., 20:76–84, 2010.
[316]
O. Favaron, H. Karami, R. Khoeilar, and S.M. Sheikholeslami. Matchings and total domination subdivision number in graphs with few induced 4-cycles. Discuss. Math. Graph Theory, to appear.
[317]
O. Favaron, H. Karami, R. Khoeilar, S.M. Sheikholeslami, and L. Volkmann. Proof of a conjecture on game domination. J. Graph Theory, 64(4):323–329, 2010.
[318]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Total domination and total domination subdivision numbers. Austral. J. Combin., 38:229–235, 2007.
[319]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Connected domination subdivision numbers of graphs. Utilitas Math., 77:101–111, 2008.
[320]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Disproof of a conjecture on the subdivision domination number of a graph. Graphs and Combinatorics, 24 (4):309–312, 2008.
[321]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Paired-domination number of a graph and its complement. Discrete Math., 308 (24):6601–6605, 2008.
[322]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Total domination and total domination subdivision numbers of a graph and its complement. Discrete Math., 38 (17):4018–4023, 2008.
[323]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Total domination in k5- and k6-covered graphs. Discrete Math. Theor. Comput. Science, 10:1:35–42, 2008.
[324]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Paired-domination subdivision numbers of graphs. Graphs and Combinatorics, 25(4):503–512, 2009.
[325]
O. Favaron, H. Karami, and S.M. Sheikholeslami. Bounding the total domination subdivision number of a graph in terms of its order. J. Combin. Optim., 21 (2):209–218, 2011.
[326]
O. Favaron and M. Kouider. Path partitions and cycle partitions of eulerian graphs of maximum degree 4. Studia Sci.Math.Hungarica, 23:237–244, 1988.
[327]
O. Favaron and M. Kouider. Path partitions and cycle partitions of eulerian graphs of maximum degree 4. Studia Sci. Math. Hungarica, 23:237–244, 1988.
[328]
O. Favaron, M. Kouider, and M. Mahéo. Edge-vulnerability and mean distance. Networks, 19:493–504, 1989.
[329]
O. Favaron, M. Kouider, and M. Mahéo. Edge-vulnerability and mean distance. Networks, 19 (5):493–504, 1989.
[330]
O. Favaron and D. Kratsch. Ratios of domination parameters. In Advances in Graph Theory, pages 173–182. V. Kulli, Vishwa International Publications, 1991.
[331]
O. Favaron, R.C. Laskar, and D. Rautenbach. t-partitions and s-complete t-partitions of a graph. Austral. J. Combin., 36:295–302, 2006.
[332]
O. Favaron, H. Li, and M. Plummer. Some results on kr-covered graphs. Technical Report 1059, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1996.
[333]
O. Favaron, H. Li, and M. D. Plummer. Some results on Kr-covered graphs. Utilitas Math., 54:33–44, 1998.
[334]
O. Favaron, H. Li, and R. H. Schelp. Strong edge colorings of graphs. Discrete Math., 159:103–109, 1996.
[335]
O. Favaron, H. Li, and R.H. Schelp. Strong edge coloring of graphs. Discrete Mathematics, 159:103–109, 1996.
[336]
O. Favaron, Z. Lonc, and M. Truszczynski. Decompositions of graphs into graphs with three edges. Ars Combin., 20:125–146, 1985.
[337]
O. Favaron, P. Mago, C. Maulino, and O. Ordaz. Hamiltonian properties of bipartite graphs and digraphs with bipartite independence 2. SIAM J. Discrete Math., 6, no 2:189–196, 1993.
[338]
O. Favaron, P. Mago, and O. Ordaz. On the bipartite independence number of a balanced bipartite graph. Discrete Math., 121:55–63, 1993.
[339]
O. Favaron, M. Mahéo, and J.-F. Saclé. Some results on conjectures of Graffiti - I. Ars Combin., 29 C:90–106, 1990.
[340]
O. Favaron, M. Mahéo, and J.-F. Saclé. Some results on conjectures of graffiti I. Proceedings of the 12th British Combinatorial Conference, Ars Combinatoria, 29 C:90–106, 1990.
[341]
O. Favaron, M. Mahéo, and J.-F. Saclé. On the residue of a graph. J. Graph Theory, 15:39–64, 1991.
[342]
O. Favaron, M. Mahéo, and J.-F. Saclé. On the residue of a graph. J. Graph Theory, 15:39–64, 1991.
[343]
O. Favaron, M. Mahéo, and J.-F. Saclé. Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discrete Math., 111:197–220, 1993.
[344]
O. Favaron, M. Mahéo, and J.-F. Saclé. Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discrete Math., 111:197–220, 1993.
[345]
O. Favaron, M. Mahéo, and J.-F. Saclé. The Randić index and other Graffiti parameters of graphs. MATCH - Commun. Math. Comput. Chem., 47:7–23, 2003.
[346]
O. Favaron and C. M. Mynhardt. On the sizes of least common multiples of several pairs of graphs. Ars Combin., 43:181–190, 1996.
[347]
O. Favaron and C. M. Mynhardt. On equality in an upper bound for domination parameters of graphs. J. Graph Theory, 24 (3):221–231, 1997.
[348]
O. Favaron and O. Ordaz. A sufficient condition for oriented graphs to be hamiltonian. Discrete Math., 58:243–252, 1986.
[349]
O. Favaron and J. Puech. Irredundance in grids. Discrete Math., 179:257–265, 1998.
[350]
O. Favaron and J. Puech. Irredundant and perfect neighborhood sets in graphs and claw-free graphs. Discrete Math., 197-198 (1-3):269–284, 1999.
[351]
O. Favaron and Y. Redouane. Minimum independent generalized t-degree and independence number in K1,r+1-free graphs. Discrete Math., 165/166:253–261, 1997.
[352]
O. Favaron and Y. Redouane. Neighborhood unions and regularity in graphs. Theoretical Computer Science, 263:247–254, 2001.
[353]
O. Favaron and M. Shi. k−factor-critical graphs and induced subgraphs. Congr. Numer., 122:59–66, 1996.
[354]
O. Favaron and M. Shi. Minimally k−factor-critical graphs. Austral. J. Combin., 17:89–97, 1998.
[355]
O. Favaron, D. P. Sumner, and E. Wojcicka. The diameter of domination k-critical graphs. J. Graph Theory, 18, no 7:723–734, 1994.
[356]
O. Favaron, F. Tian, and L. Zhang. Independence and hamiltonicity in 3-domination-critical graphs. J. Graph Theory, 25 (3):173–184, 1997.
[357]
E. Flandrin. Cycles hamiltoniens et dominants dans le carré d'un graphe connexe. Internal Report 208, LRI, 1985.
[358]
E. Flandrin, J-L. Fouquet, and H. Li. On hamilton claw-free graphs. Discrete Mathematics, 111:221–229, 1993.
[359]
E. Flandrin, J-L. Fouquet, and H. Li. Hamiltonicity of bipartite biclaw-free graphs. Discrete Applied Mathematics, 51:95–102, 1994.
[360]
E. Flandrin, J.L. Fouquet, and H. Li. On hamiltonian claw-free graphs. Disc. Math., 111:221–229, 1993.
[361]
E. Flandrin, J.L. Fouquet, and H. Li. Hamiltonism in bipartite biclaw-free graphs. Disc. Math., a paraitre.
[362]
E. Flandrin, I Fournier, and A. Germa. Numérotations gracieuses des chemins. Ars Combinatoria, 16:149–181, 1983.
[363]
E. Flandrin, I. Fournier, and A. Germa. Pancyclism in k1,3-free graphs. Internal Report 282, LRI, 1986.
[364]
E. Flandrin, I Fournier, and A. Germa. Circumference and hamiltonism in K1,3-free graphs. Annals of Disc. Math. (Graph Theory in memory of G.A. Dirac), 41:131–140, 1989.
[365]
E. Flandrin, Fouquet J.L., and H. Li. Claw-free graph, a survey. Disc. Math., 164:87–147, 1997.
[366]
E. Flandrin, H.A. Jung, and H. Li. Degree sum, neighbourhood intersections and hamiltonism. Discrete Mathematics, 90:41–52, 1991.
[367]
E. Flandrin, H.A. Jung, and H. Li. Hamiltonism, degree sum and neighborhood intersection. Disc. Math., 90:41–52, 1991.
[368]
E. Flandrin and H. Li. Further results on neighbourhood intersections. Technical Report 416, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1988.
[369]
E. Flandrin and H. Li. Hamiltonism and neighbourhood intersections. Technical Report 406, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 2 1988.
[370]
E. Flandrin and H Li. More result on hamiltonism and claws. Technical Report 398, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1 1988.
[371]
E. Flandrin and H. Li. Chvátal erdős condition in 3-connected claw-free graphs. Internal Report 500, LRI, 1989.
[372]
E. Flandrin and H. Li. Chvátal-erdös condition in 3-connected claw-free graphs. Technical Report 500, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 6 1989.
[373]
E. Flandrin and H. Li. More results on hamiltonism and claws. Ars Combinatoria, 29C:77–89, 1990.
[374]
E. Flandrin and H Li. Menger type parameters and hamiltonian graphs. Networks, 24:177–183, 1994.
[375]
E. Flandrin and H. Li. Mengerian properties, hamiltonicity, and claw-free graphs. Networks, 24:177–183, 1994.
[376]
E. Flandrin and H. Li. Further results on neighborhood intersection. Internal Report 416, LRI, 1998.
[377]
E. Flandrin, H. Li, and I. Schiermeyer. Hamiltonism and vertices with a common neighbor. Internal Report 690, LRI, 1991.
[378]
E. Flandrin, H. Li, and I. Schiermeyer. Hamiltonism and vertices with a common neighbor. Technical Report 690, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1991.
[379]
E. Flandrin, F. Tian, B. Wei, and L. Zhang. Some properties of 3-domination-critical graphs. Internal Report 1038, LRI, 1996.
[380]
D. Forge. Bases in Orlik-Solomon type algebras. European J. of Combin., 23:567–572, 2002.
[381]
D. Forge and R. Cordovil. Quadratic Orlik-Solomon algebras of graphic matroids. Matematica Contemporanea, 25:25–32, 2003.
[382]
D. Forge and R. Florez. Minimal non-orientable matroids in a projective plane. J. Combin. Theory Ser. A, 114:567–572, 2007.
[383]
D. Forge and M. Kouider. Coverings of the vertices of a graph by small cycles. Research report 1374, LRI, 2003.
[384]
D. Forge and M. Kouider. Coverings of the vertices of a graph by small cycles. Graphs Combin., 23(2):135–143, 2007.
[385]
D. Forge and J. Ramirez-Alfonsin. Connected coverings and an application to oriented matroids. Discrete Math., 187:109–101, 1998.
[386]
D. Forge and J. Ramirez-Alfonsin. Straight line arrangements in the real projective plane. Discrete and computational geometry, 20:155–161, 1998.
[387]
D. Forge and J. Ramirez-Alfonsin. On counting the k-face cells of cyclic arrangements. European J. of Combin., 22:307–312, 2001.
[388]
D. Forge and J. Ramirez-Alfonsin. On reconstructing arrangements from their sets of simplices. Discrete Math., 226:175–190, 2001.
[389]
D. Forge, J. Ramirez-Alfonsin, and H. Yeun. Disconnected coverings for oriented matroids via simultaneous mutations. Discrete Math., 258:353–359, 2002.
[390]
D. Forge and M. Las Vergnas. Orlik-Solomon type algebras. European J. of Combin., 22:699–704, 2001.
[391]
D. Forge, M. Las Vergnas, and P. Schuchert. A set of 10 points not projectively equivalent to the vertices of a polytope. European J. of Combin., 22:705–708, 2001.
[392]
D. Forge and T. Zaslavsky. Lattice point counts for the shi arrangement and other affinographic hyperplane arrangements. J. Combin. Theory Ser. A, 114:97–109, 2007.
[393]
T. Gao, H. Li, and B. Wei. Longest cycles in 2-connected claw-free graphs. Systems Science and Mathematical Sciences, 10(2):176–182, 1997.
[394]
C. Gicquel, M. Minoux, and Y. Dallery. On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. Operations Research Letters, 37:32–36, 2009.
[395]
C. Gicquel, M. Minoux, and Y. Dallery. Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources. International Journal of Production Research, 49:2587–2603, 2011.
[396]
C. Gicquel, M. Miègeville, M. Minoux, and Y. Dallery. Discrete lot-sizing and scheduling using product decomposition into attributes. Computers & Operations Research, 36:2690–2698, 2009.
[397]
C. Gicquel, M. Miègeville, M. Minoux, and Y. Dallery. Optimizing glass coating lines: MIP model and valid inequalities. European Journal of Operational Research, 202:747–755, 2010.
[398]
J. Gimbel, M. Mahéo, and C. Virlouvet. Double total domination of graphs. Discrete Mathematics, 165-166:333–341, 1997.
[399]
R. Häggkvist and M. Kouider. A lower bound on the circumference of 3-connected k-regular 4k-order graphs. Graphs and combinatorics, à paraître.
[400]
A. Harkat-Benhamdine, H. Li, and F. Tian. Cyclability of 3-connected graphs. Technical Report 1050, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 5 1996.
[401]
B. Jackson and H. Li. Hamilton cycles in 2-connected k-regular bipartite graphs. Journal of Combinatorial Theory B, 62(2):236–258, 1994.
[402]
B. Jackson, H. Li, and Y. Zhu. Dominating cycles in regular 3-connected graphs. Discrete Mathematics, 102:163–176, 1991.
[403]
F. Jaeger, M. Kouider, and C. Payan. Partition of graphs into bistars. Discrete Math., 46(1):93–95, 1983.
[404]
H. Kheddouci and M. Kouider. Hamilton cycle decomposition of some cubic graphs by cycles. Jounal of Comb. Theory and Comb. Computing, 32:3–22, 2000.
[405]
Stefanie Kosuch, Pierre Le Bodic, Janny Leung, and Abdel Lisser. On a stochastic bilevel programming problem with knapsack constraints. In International Network Optimization Conference, 2009.
[406]
M. Kouider. Groupes formels à n paramètres. Comptes Rendus de l'Acad. des Sciences ( A ), 270:1109–1112, 1970.
[407]
M. Kouider. Groupes formels isogènes à un groupe donné. C.R.Acad. des Sciences, Série A, 283:201–202, 1976.
[408]
M. Kouider. Hamiltonisme et graphe de cordes. Thèse d'Etat Orsay, 1991.
[409]
M. Kouider. Cycles in graphs with prescribed connectivity and stability. J. Combin. Theory Serie B, 60:325–329, 1993.
[410]
M. Kouider. Covering vertices by cycles. Journal of Graph Theory, 18(8):757–776, 1994.
[411]
M. Kouider. Covering vertices by cycles and neighborhoods. Combinatorica, 20(2):219–226, 2000.
[412]
M. Kouider. On mean distance and four third's conjecture. Networks, a paraitre.
[413]
M. Kouider and Z. Lonc. Path decompositions and perfect double cover. Australasian Journal of Comb., 19:261–274, 1999.
[414]
M. Kouider and Z. Lonc. Covering cycles and k-term degree sums. Combinatorica, 16(3):407–412, 2000.
[415]
M. Kouider and Z. Lonc. Stability number and (a,b) factors in graphs. Technical Report 1316, Laboratoire de Recherche en Informatique, Université Paris-Sud, France, 2002.
[416]
M. Kouider and Z. Lonc. Decomposition of regular graphs into paths. Rapport LRI 940, soumis à Discrete Maths, Dec. 1994.
[417]
M. Kouider and M. Mahéo. Connected (a,b)-factors in graphs. Technical Report 1151, L.R.I., 1998.
[418]
M. Kouider and M. Mahéo. 2 edge-connected [2,k]-factors in graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 35:89–95, 2000.
[419]
M. Kouider and M. Mahéo. Two-edge-connected [2,k]-factors in graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 35:89–95, 2000.
[420]
M. Kouider and M. Mahéo. Connected [a,b]-factors in graphs. Combinatorica, 22:71–82, 2002.
[421]
M. Kouider and M. Mahéo. Connected (a,b)-factors in graphs. Combinatorica, 22-1:71–82, 2002.
[422]
M. Kouider and M. Mahéo. Some bounds for the b-chromatic number of a graph. Discrete Math., à paraître.
[423]
M. Kouider and M. Mahéo. The b-chromatic number of products of graphs. Combinatorica, aparaitre.
[424]
M. Kouider and M. Mahéo. Some bounds for the b-chromatic number of a graph. Discrete Maths, aparaitre.
[425]
M. Kouider and A. Marczyk. On pancyclism of hamiltonian graphs. Discrete Maths, 251:119–127, 2002.
[426]
M. Kouider, B. Péroche, and D. Sotteau. Product and path numbers: the cartesian product. Ars Combinatoria, 21:33–50, 1986.
[427]
M. Kouider and G. Sabidussi. Factorisations of 4-regular graphs and petersen's theorem. Journal of Combinatorial Theory B, 63(2):170–184, 1995.
[428]
M. Kouider and D. Sotteau. Products and path number: the cartesian product. Rapport LRI 148, 1983.
[429]
M. Kouider and D. Sotteau. On the existence of a matching orthogonal to a 2-factorisation. Communication Discrete Maths, 73:301–304, 1989.
[430]
M. Kouider and P. Vestergaard. On even [a,b] factors in graphs. Technical Report 1298, Laboratoire de Recherche en Informatique, Université Paris-Sud, France, 2001.
[431]
M. Kouider and P.D. Vestergaard. On even [2,k] factors in graphs. Australasian Journal of Combinatorics, aparaitre.
[432]
M. Kouider and P. Winkler. Mean distance and minimum degree. Journal of Graph Theory, 25((1)):95–99, 1997.
[433]
Pierre Le Bodic, Sébastien Adam, Pierre Héroux, Arnaud Knippel, and Yves Lecourtier. Formulations linéaires en nombres entiers pour des problèmes d'isomorphisme exact et inexact. In Cinquième Journées Polyèdres et Optimisation Combinatoire, 2008.
[434]
Pierre Le Bodic, Pierre Héroux, Sébastien Adam, and Yves Lecourtier. Programmation linéaire en nombres entiers pour la recherche d'isomorphisme de sous-graphe : application à la recherche de symboles graphiques. In Atelier GAOC, 11ème Conférence Internationale Francophone sur l'Extraction et la Gestion des Connaissances, 2011.
[435]
Pierre Le Bodic, Pierre Héroux, Sébastien Adam, Hervé Locteau, Jean-Noël Bilong Mboumba, and Yves Lecourtier. Programmation linéaire en nombres entiers pour la recherche d'isomorphisme de sous-graphe : application à la recherche de symboles graphiques. In Colloque International Francophone sur l'Écrit et le Document, 2010.
[436]
Pierre Le Bodic, Stefanie Kosuch, Janny Leung, and Abdel Lisser. An iterative scheme for the bilevel linear problem. In 20th International Symposium on Mathematical Programming, 2009.
[437]
Pierre Le Bodic, Hervé Locteau, Sébastien Adam, Pierre Héroux, Yves Lecourtier, and Arnaud Knippel. Symbol detection using region adjacency graphs and integer linear programming. In 10th International Conference on Document Analysis and Recognition, 2009.
[438]
H. Li. Hamiltonian cycles and circumferences. PhD thesis, Institute of Systems Science, The Chinese Academy of Sciences, 1986.
[439]
H. Li. Edge disjoint hamiltonian paths connecting any two vertices of graphs. Technical Report 405, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1988.
[440]
H. li. Hamiltonian cycles in regular graphs. Science Bulletin of China, pages 474–475, 1988.
[441]
H. Li. Edge disjoint cycles in graphs. Journal of Graph Theory, 13(3):313–322, 1989.
[442]
H. Li. Edge-hamiltonian property in regular 2-connected graphs. Discrete Mathematics, 82:25–34, 1990.
[443]
H. li. Perfect path double cover in every simple graph. Journal of Graph Theory, 14(6):645–650, 1990.
[444]
H. Li. Cycles et chemins dans les graphes. Thèse d'habilitation à diriger des recherche, LRI, URA 410 du CNRS, Université de Paris sud, LRI,URA 410 du CNRS, Bat.490, Université de Paris sud, 91405-Orsay, FRANCE, 1993.
[445]
H. Li. Circumferences in 1-tough graphs. Discrete Mathematics, 146:145–151, 1995.
[446]
H. Li. Hamiltonian cycles in 2-connected claw free graphs. Journal of Graph Theory, 20(4):447–457, 1995.
[447]
H. Li. A note on hamiltonian claw-free graphs. Technical Report 1022, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1996.
[448]
H. Li and E. Flandrin. Hamiltonism and claws. Ars Combinatoria, 29:77–89, 1990.
[449]
H. Li, M. Lu, and Z. Sun. Hamiltonicity in 2-connected graphs with claws. Discrete Mathematics, to appear.
[450]
H. Li, M. Lu, F. Tian, and B Wei. Hamiltonian cycles in claw-free graphs with at most 5δ-5 vertices. Congressus Numerantium, 122:203–206, 1996.
[451]
H. Li, M. Lu, F. Tian, and B. Wei. Hamiltonicity in claw-center-independent graphs. Discrete Mathematics, 165/166:469–479, 1997.
[452]
H. Li and F. Tian. Degree sums, claws and hamiltonicity. Technical Report 886, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 01 1994.
[453]
H. Li and C. Virlouvet. Neighborhood conditions for claw-free hamiltonian graphs. Ars Combinatoria, 29:109–116, 1990.
[454]
H. Li and J. Xu. (d, m)-dominating number of m-connected graphs. Technical Report 1130, LRI, URA 410 du CNRS, Université de Paris sud, LRI, URA 410 du CNRS, Bat. 490, Université de Paris sud, 91405-Orsay, FRANCE, 1997.
[455]
H. Li and Y. Zhu. The progress of hamiltonian problems in graph theory. Journal of Qufu Teachers College, 2, 1985.
[456]
H. Li and Y. Zhu. Edge-disjoint hamiltonian cycles in graphs. Graph Theory and Its Applications : East and West, Annales of the New York Academy of Sciences, 576:311–322, 1990.
[457]
H. Li and Y. Zhu. Hamilton cycles in regular 3-connected graphs. Discrete Mathematics, 110:229–249, 1992.
[458]
A. Lisser. Un logiciel dérivé de l'algorithme de karmarkar pour la résolution de problèmes de grande taille. Doctorat d'Université, spécialité Méthodes Scientifiques de Gestion, September 1987. mention Très Honorable.
[459]
A. Lisser. Computational results of the dual affine method for standard linear programming and for multicommodity netflow problems. In ORSA/TIMS, Phoenix, November 1993.
[460]
A. Lisser. Solving planning network problems using interior point methods. In ASOR, Melbourne, July 1993.
[461]
A. Lisser. Computational results for an interior point method. In TIMS XXXII, Anchorage, July 1994.
[462]
A. Lisser. Computational results for multicommodity netflow problems using interior point methods. In TIMS, Singapore, October 1995.
[463]
A. Lisser. Decomposition methods for multicommodity netflow problems. In INFORMS'97, San Diego, May 1997.
[464]
A. Lisser. Survivability in telecommunication meshed networks. In Telecommunications in the 21st century: A Challenge for Operations Research, Thun, Suisse, September 1997.
[465]
A. Lisser. Heuristic for designing telecommunications networks using multiple facility services. In proceedings du congrès International Teletraffic Conference ITC'98, 1998.
[466]
A. Lisser. Multicommodity netflow problems. In congrès CLAIO'98, Buenos Aires, Argentine, 1998.
[467]
A. Lisser. Capacitated fixe charge multicommodity flow problems. In 9eme journées d'optimisation à Stockholm, June 2000.
[468]
A. Lisser. Decomposition methods for solving multicommodity flow problems. In INFORMS 2000, Séoul, June 2000.
[469]
A. Lisser, C. Andrade, G. Plateau, and N. Maculan. Stochastic programming in telecommunication networks. In INFORMS, San Antonio, November 2000.
[470]
A. Lisser, C. Andrade, G. Plateau, and N. Maculan. Stochastic network design problems. In INFORMS, Maui, Hawaii, June 2001.
[471]
A. Lisser, C. Andrade, G. Plateau, and N. Maculan. Problèmes de multiflots stochastiques. In CIRO'02, Marrakech, 2002.
[472]
A. Lisser, C. Andrade, G. Plateau, and N. Maculan. Stratégies de branch and bound pour la synthèse de réseaux dorsaux à demande incertaine. In ROADEF, Paris, February 2002.
[473]
A. Lisser, C. Andrade, G. Plateau, and N. Maculan. Optimisation stochastique et intervalles de confiances pour la synthèse de réseaux de télécommunication. In ROADEF, Avignon, February 2003.
[474]
A. Lisser and P. Chardaire. Simplex and interior point specialization algorithms for solving non-oriented multicommodity flow problems. In CSTS d'INFORMS, Montherey, 1998.
[475]
A. Lisser and P. Chardaire. Fixed charge capacitated network flow problems. In ISMP'2000, Atlanta, August 2000.
[476]
A. Lisser and J. Chifflet. Comparison of projective and affine scaling approaches in interior point methods. In TIMS-SOBRAPO XXIII, Rio, July 1991.
[477]
A. Lisser and J. Chifflet. Preconditioner matrices for interior point methods. In 6th SIAM conference on discrete mathematics, Vancouver, June 1992.
[478]
A. Lisser and R. Lopez. Recherche à voisinage variable et programmation semidéfinie positive dans les réseaux de troisième génération. In ROADEF, Lille, February 2006.
[479]
A. Lisser, N. Maculan, and M. Passini. Mixed architectures in telecommunication networks. In INFORMS 96, Atlanta, October 1996.
[480]
A. Lisser, N. Maculan, and M. Passini. Mathematical model for designing telecommunication networks. In M. Gendreau et P. Marcotte, editor, Transportation and Network Analysis - Current Trends, pages 165–179. Kluwer Academic Publisher, 2002.
[481]
A. Lisser, N. Maculan, and G. Plateau. Integer linear models with a polynomial number of variables and constraints for some classical combinatorial problems. Pesquisa Operacional,, 23:161–168, 2003.
[482]
A. Lisser and Ph. Mahey. "multicommodity flow problems and decomposition in telecommunications networks. In M. Resende and Pardalos, editors, Handbook of Optimization in Telecommunications, pages 241–267. Springer Science, 2006.
[483]
A. Lisser and B. El Oujaj. Decomposition methods for solving standard linear programming,. In Optimization'98, Coimbra, June 1998.
[484]
A. Lisser and B. El Oujaji. Extraction de réseau d'une matrice d'un programme linéaire quelconque. In ROADEF, Paris, January 1999.
[485]
A. Lisser and F. Rendl. Clustering for telecommunication networks. In ISMP'2000, Atlanta, August 2000.
[486]
A. Lisser and F. Rendl. Graph partitionning in telecommunication network. In 4th International Conference of OR, LaHavane, Cuba, March 2000.
[487]
A. Lisser and F. Rendl. Problèmes de partitionnement de graphe. In ROADEF, Nantes, January 2000.
[488]
A. Lisser and F. Rendl. Graph partitioning using linear and semidefinite programming. Mathematical Programming, 95(1):91–101, 2003.
[489]
A. Lisser, R. Sarkissian, and J.P. Vial. Spare capacity assignment algorithm based on accpm. In FRANCORO, Mons, June 1995.
[490]
A. Lisser, R. Sarkissian, and J.P. Vial. Survivability of meshed networks architectures based on accpm. In TIMS, Singapore, June 1995.
[491]
A. Lisser, R. Sarkissian, and J.P. Vial. Survivability of meshed networks architectures based on accpm. In APMOD'95, Londres, April 1995.
[492]
A. Lisser, R. Sarkissian, and J.P. Vial. Optimal joint synthesis of base and reserve telecommunication networks. In SIAM Conference, Victoria, Canada, May 1996.
[493]
A. Lisser, R. Sarkissian, and J.P. Vial. Optimal joint synthesis of base and reserve telecommunication networks. In ISMP'97, Lausanne, August 1997.
[494]
A. Lisser, R. Sarkissian, and J.P. Vial. "lower bounds for survivability in telecommunication networks". Investigation Operativa, 9:21–47, 2000.
[495]
A. Lisser and P. Tolla. An efficient software using the karmarkar's algorithm. In Euro IX, Paris, June 1988.
[496]
A. Lisser and P. Tolla. Variants of karmarkar's algorithm. Investigation Operativa, 1:185–197, 1989.
[497]
A. Lisser and J.P. Vial. A heuristic for solving the survivability problem in telecommunication networks. In Fifth SIAM Conference, Victoria, Canada, May 1996.
[498]
A. Lisser, J.P. Vial, A. Ouorou, and J. Gondzio. Capacity planning under uncertain demand in telecommunication networks. In IFORS'99, Pékin, August 1999.
[499]
R. Lopez and A. Lisser. Recherche à voisinage variable et programmation semidéfinie positive dans les réseaux de troisième génération,. In Actes ROADEF'06, pages 41–56. Presses Universitaires de Valenciennes, 2006.
[500]
M. Mahéo. Strongly graceful graphs. Discrete Math., 29:39–46, 1980.
[501]
M. Mahéo and J.-F. Saclé. Note on the problem of gossiping in multidimensional grids. Discrete Applied Math, 53:287–290, 1994.
[502]
M. Mahéo and J.-F. Saclé. Some minimum broadcast graphs. Discrete Applied Math, 53:275–285, 1994.
[503]
M. Mahéo and J.-F. Saclé. Some minimum broadcast graphs. Discrete Applied Mathematics, 53:275–285, 1994.
[504]
M. Mahéo, J.-F. Saclé, and M. Wozniak. Edge-disjoint placement of three trees. European Journal of Combinatorics, 17:543–563, 1996.
[505]
M. Mahéo and H. Thuillier. On d-graceful graphs. Ars Combin., 13:181–192, 1982.
[506]
J.-F. Saclé. Lower bounds for the size in four families of minimum broadcast graphs. Discrete Mathematics, 150:359–369, 1996.
[507]
J.-F. Saclé and M. Woźniak. The Erdős-Sós conjecture for graphs without C4. Journal of combinatorial Theory, Series B, 70-2:367–372, 1997.
[508]
J.-F. Saclé and M. Woźniak. A note on graphs which contain each tree of given size. Discrete Mathematics, 165/166:599–605, 1997.
[509]
J.-F. Saclé and M. Woźniak. A note on packing of three forests. Discrete Mathematics, 164:265–274, 1997.
[510]
M. Shi, X. Yuan, M. Cai, and O. Favaron. (3,k)−factor-critical graphs and toughness. Graphs Combin., 15:463–471, 1999.
Ce document a été traduit de LATEX par HEVEA