| 2012 | ||
|---|---|---|
| j92 | Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann: k-Domination and k-Independence in Graphs: A Survey. Graphs and Combinatorics 28(1): 1-55 (2012) | |
| 2011 | ||
| j91 | Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Bounding the total domination subdivision number of a graph in terms of its order. J. Comb. Optim. 21(2): 209-218 (2011) | |
| 2010 | ||
| j90 | M. H. Akhbari, R. Hasni, Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Inequalities of Nordhaus-Gaddum type for doubly connected domination number. Discrete Applied Mathematics 158(14): 1465-1470 (2010) | |
| j89 | Odile Favaron, Hosein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami: Matchings and total domination subdivision number in graphs with few induced 4-cycles. Discussiones Mathematicae Graph Theory 30(4): 611-618 (2010) | |
| j88 | Odile Favaron, Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami: On the total domination subdivision number in some classes of graphs. J. Comb. Optim. 20(1): 76-84 (2010) | |
| j87 | Odile Favaron, François Genest, Mekkia Kouider: Regular path decompositions of odd regular graphs. Journal of Graph Theory 63(2): 114-128 (2010) | |
| j86 | Odile Favaron, Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann: Proof of a conjecture on game domination. Journal of Graph Theory 64(4): 323-329 (2010) | |
| 2009 | ||
| j85 | Mustapha Aouchiche, Odile Favaron, Pierre Hansen: Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. Discrete Applied Mathematics 157(17): 3497-3510 (2009) | |
| j84 | H. Aram, Seyed Mahmoud Sheikholeslami, Odile Favaron: Domination subdivision numbers of trees. Discrete Mathematics 309(4): 622-628 (2009) | |
| j83 | Odile Favaron, Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami: On the Roman domination number of a graph. Discrete Mathematics 309(10): 3447-3451 (2009) | |
| j82 | Odile Favaron, Hosein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami: A New Bound on the Total Domination Subdivision Number. Graphs and Combinatorics 25(1): 41-47 (2009) | |
| j81 | Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Paired-Domination Subdivision Numbers of Graphs. Graphs and Combinatorics 25(4): 503-512 (2009) | |
| j80 | Mustapha Aouchiche, Odile Favaron, Pierre Hansen: Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille. RAIRO - Operations Research 43(4): 339-358 (2009) | |
| 2008 | ||
| j79 | Odile Favaron: Global Alliances and Independent Domination in Some Classes of Graphs. Electr. J. Comb. 15(1) (2008) | |
| j78 | Odile Favaron, Michael A. Henning: Total domination in claw-free graphs with minimum degree 2. Discrete Mathematics 308(15): 3213-3219 (2008) | |
| j77 | Odile Favaron, Michael A. Henning: Bounds on total domination in claw-free cubic graphs. Discrete Mathematics 308(16): 3491-3507 (2008) | |
| j76 | Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Dalila Raber: Ratios of some domination parameters in trees. Discrete Mathematics 308(17): 3879-3887 (2008) | |
| j75 | Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Total domination and total domination subdivision number of a graph and its complement. Discrete Mathematics 308(17): 4018-4023 (2008) | |
| j74 | Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt: Open irredundance and maximum degree in graphs. Discrete Mathematics 308(23): 5358-5375 (2008) | |
| j73 | Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Paired-domination number of a graph and its complement. Discrete Mathematics 308(24): 6601-6605 (2008) | |
| j72 | Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah: Maximal k-independent sets in graphs. Discussiones Mathematicae Graph Theory 28(1): 151-163 (2008) | |
| j71 | Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Total Domination in K5- and K6-covered graphs. Discrete Mathematics & Theoretical Computer Science 10(1) (2008) | |
| j70 | Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami: Disproof of a Conjecture on the Subdivision Domination Number of a Graph. Graphs and Combinatorics 24(4): 309-312 (2008) | |
| j69 | Odile Favaron, Adriana Hansberg, Lutz Volkmann: On k-domination and minimum degree in graphs. Journal of Graph Theory 57(1): 33-40 (2008) | |
| 2007 | ||
| j68 | Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah: On k-independence in graphs with emphasis on trees. Discrete Mathematics 307(17-18): 2209-2216 (2007) | |
| 2004 | ||
| j67 | Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt: Total domination in Kr-covered graphs. Ars Comb. 71 (2004) | |
| j66 | Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt: On i--ER-critical graphs. Discrete Mathematics 276(1-3): 111-125 (2004) | |
| j65 | Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, R. Duane Skaggs: Offensive alliances in graphs. Discussiones Mathematicae Graph Theory 24(2): 263-175 (2004) | |
| j64 | Odile Favaron, Michael A. Henning: Paired-Domination in Claw-Free Cubic Graphs. Graphs and Combinatorics 20(4): 447-456 (2004) | |
| 2003 | ||
| j63 | Charles Delorme, Odile Favaron, Dieter Rautenbach: Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discrete Applied Mathematics 130(3): 503-512 (2003) | |
| j62 | Odile Favaron: Independence and upper irredundance in claw-free graphs. Discrete Applied Mathematics 132(1-3): 85-95 (2003) | |
| j61 | Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech: Irredundance and domination in kings graphs. Discrete Mathematics 262(1-3): 131-147 (2003) | |
| j60 | Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt: Changing upper irredundance by edge addition. Discrete Mathematics 266(1-3): 185-193 (2003) | |
| j59 | Odile Favaron, Michael A. Henning: Upper total domination in claw-free graphs. Journal of Graph Theory 44(2): 148-158 (2003) | |
| 2002 | ||
| j58 | Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: On k-dependent domination. Discrete Mathematics 249(1-3): 83-94 (2002) | |
| j57 | Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley: Total irredundance in graphs. Discrete Mathematics 256(1-2): 115-127 (2002) | |
| j56 | Charles Delorme, Odile Favaron, Dieter Rautenbach: On the Randic Image index. Discrete Mathematics 257(1): 29-38 (2002) | |
| j55 | Gábor Bacsó, Odile Favaron: Independence, irredundance, degrees and chromatic number in graphs. Discrete Mathematics 259(1-3): 257-262 (2002) | |
| j54 | Charles Delorme, Odile Favaron, Dieter Rautenbach: On the reconstruction of the degree sequence. Discrete Mathematics 259(1-3): 293-300 (2002) | |
| 2001 | ||
| j53 | Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech: Generalised Ramsey Numbers with respect to Classes of Graphs. Ars Comb. 59 (2001) | |
| j52 | Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech: Ramsey properties of generalised irredundant sets in graphs. Discrete Mathematics 231(1-3): 123-134 (2001) | |
| j51 | Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach: On domination and annihilation in graphs with claw-free blocks. Discrete Mathematics 231(1-3): 143-151 (2001) | |
| j50 | Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek: Clique covering and degree conditions for hamiltonicity in claw-free graphs. Discrete Mathematics 236(1-3): 65-80 (2001) | |
| j49 | Odile Favaron: Inflated graphs with equal independence number and upper irredundance number. Discrete Mathematics 236(1-3): 81-94 (2001) | |
| j48 | Odile Favaron, Pierre Fraisse: Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. J. Comb. Theory, Ser. B 82(2): 297-305 (2001) | |
| j47 | Odile Favaron, Y. Redouane: Neighborhood unions and regularity in graphs. Theor. Comput. Sci. 263(1-2): 247-254 (2001) | |
| 2000 | ||
| j46 | ||
| j45 | Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt: On i-minus-Edge-Removal-critical graphs. Electronic Notes in Discrete Mathematics 5: 64-66 (2000) | |
| j44 | Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech: Total domination in graphs with minimum degree three. Journal of Graph Theory 34(1): 9-19 (2000) | |
| j43 | Stephan Brandt, Odile Favaron, Zdenek Ryjácek: Closure and stable Hamiltonian properties in claw-free graphs. Journal of Graph Theory 34(1): 30-41 (2000) | |
| j42 | Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech: A characterization of (γ, i)-trees. Journal of Graph Theory 34(4): 277-292 (2000) | |
| 1999 | ||
| j41 | Jan Brousek, Zdenek Ryjácek, Odile Favaron: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discrete Mathematics 196(1-3): 29-50 (1999) | |
| j40 | Odile Favaron, Joël Puech: Irredundant and perfect neighborhood sets in graphs and claw-free graphs. Discrete Mathematics 197-198: 269-284 (1999) | |
| j39 | Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu: On 2-factors in claw-free graphs. Discrete Mathematics 206(1-3): 131-137 (1999) | |
| j38 | Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian: An Ore-type condition for pancyclability. Discrete Mathematics 206(1-3): 139-144 (1999) | |
| j37 | Mao-cheng Cai, Odile Favaron, Hao Li: (2, k)-Factor-Critical Graphs and Toughness. Graphs and Combinatorics 15(2): 137-142 (1999) | |
| j36 | Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron: (3, k)-Factor-Critical Graphs and Toughness. Graphs and Combinatorics 15(4): 463-471 (1999) | |
| 1998 | ||
| j35 | ||
| j34 | Ahmed Ainouche, Odile Favaron, Hao Li: Global insertion and hamiltonicity in DCT-graphs. Discrete Mathematics 184(1-3): 1-13 (1998) | |
| j33 | Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech: An inequality chain of domination parameters for trees. Discussiones Mathematicae Graph Theory 18(1): 127-142 (1998) | |
| j32 | ||
| 1997 | ||
| j31 | Odile Favaron, Y. Redouane: Minimum independent generalized t-degree and independence number in K1, r+1-free graphs. Discrete Mathematics 165-166: 253-261 (1997) | |
| j30 | Odile Favaron, Zdenek Ryjácek: Factor-criticality and matching extension in DCT-graphs. Discussiones Mathematicae Graph Theory 17(2): 271-278 (1997) | |
| j29 | Odile Favaron, Christina M. Mynhardt: On equality in an upper bound for domination parameters of graphs. Journal of Graph Theory 24(3): 221-231 (1997) | |
| j28 | Odile Favaron, Feng Tian, Lei Zhang: Independence and hamiltonicity in 3-domination-critical graphs. Journal of Graph Theory 25(3): 173-184 (1997) | |
| 1996 | ||
| j27 | Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek: Shortest walks in almost claw-free graphs. Ars Comb. 42 (1996) | |
| j26 | Odile Favaron, Christina M. Mynhardt: On the sizes of least common multiples of several pairs of graphs. Ars Comb. 43 (1996) | |
| j25 | ||
| j24 | ||
| j23 | Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt: Universal maximal packing functions of graphs. Discrete Mathematics 159(1-3): 57-68 (1996) | |
| j22 | Odile Favaron, Hao Li, Richard H. Schelp: Strong edge colorings of graphs. Discrete Mathematics 159(1-3): 103-109 (1996) | |
| j21 | Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li: Pancyclism and small cycles in graphs. Discussiones Mathematicae Graph Theory 16(1): 27-40 (1996) | |
| j20 | Odile Favaron: On k-factor-critical graphs. Discussiones Mathematicae Graph Theory 16(1): 41-51 (1996) | |
| j19 | Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu: Sequences, claws and cyclability of graphs. Journal of Graph Theory 21(4): 357-369 (1996) | |
| 1995 | ||
| j18 | Denise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz: Biclosure and bistability in a balanced bipartite graph. Journal of Graph Theory 20(4): 513-529 (1995) | |
| 1994 | ||
| j17 | Odile Favaron, Jean-Luc Fouquet: On m-centers in Pt-free graphs. Discrete Mathematics 125(1-3): 147-152 (1994) | |
| j16 | Odile Favaron, David P. Sumner, Ewa Wojcicka: The diameter of domination k-critical graphs. Journal of Graph Theory 18(7): 723-734 (1994) | |
| 1993 | ||
| j15 | Odile Favaron, Maryvonne Mahéo, Jean-François Saclé: Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discrete Mathematics 111(1-3): 197-220 (1993) | |
| j14 | Odile Favaron: A note on the irredundance number after vertex deletion. Discrete Mathematics 121(1-3): 51-54 (1993) | |
| j13 | Odile Favaron, Pedro Mago, Oscar Ordaz: On the bipartite independence number of a balanced bipartite graph. Discrete Mathematics 121(1-3): 55-63 (1993) | |
| j12 | Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li: The complete closure of a graph. Journal of Graph Theory 17(4): 481-494 (1993) | |
| j11 | Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz: Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2. SIAM J. Discrete Math. 6(2): 189-196 (1993) | |
| 1991 | ||
| j10 | Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray: The product of the independent domination numbers of a graph and its complement. Discrete Mathematics 90(3): 313-317 (1991) | |
| j9 | Odile Favaron, Maryvonne Mahéo, Jean-François Saclé: On the residue of a graph. Journal of Graph Theory 15(1): 39-64 (1991) | |
| 1990 | ||
| j8 | Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau: A parameter linked with G-factors and the binding number. Discrete Mathematics 91(3): 311-316 (1990) | |
| 1989 | ||
| j7 | Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo: Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Theory, Ser. B 46(2): 142-153 (1989) | |
| j6 | Odile Favaron, Mekkia Kouider, Maryvonne Mahéo: Edge-vulnerability and mean distance. Networks 19(5): 493-504 (1989) | |
| 1988 | ||
| j5 | Odile Favaron: Two relations between the parameters of independence and irredundance. Discrete Mathematics 70(1): 17-20 (1988) | |
| 1986 | ||
| j4 | Odile Favaron, Oscar Ordaz: A sufficient condition for oriented graphs to be Hamiltonian. Discrete Mathematics 58(3): 243-252 (1986) | |
| 1985 | ||
| j3 | Odile Favaron: On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. J. Comb. Theory, Ser. B 39(1): 101-102 (1985) | |
| 1982 | ||
| j2 | ||
| 1981 | ||
| j1 | Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason: Contributions to the theory of domination, independence and irredundance in graphs. Discrete Mathematics 33(3): 249-258 (1981) | |
Colors in the list of coauthors
Last update Mon May 20 21:51:49 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page