| 2008 |
|---|
| 55 | EE | Odile Favaron,
Michael A. Henning:
Total domination in claw-free graphs with minimum degree 2.
Discrete Mathematics 308(15): 3213-3219 (2008) |
| 54 | EE | Odile Favaron,
Michael A. Henning:
Bounds on total domination in claw-free cubic graphs.
Discrete Mathematics 308(16): 3491-3507 (2008) |
| 53 | EE | Mustapha Chellali,
Odile Favaron,
Teresa W. Haynes,
Dalila Raber:
Ratios of some domination parameters in trees.
Discrete Mathematics 308(17): 3879-3887 (2008) |
| 52 | EE | Odile Favaron,
H. Karami,
S. M. Sheikholeslami:
Total domination and total domination subdivision number of a graph and its complement.
Discrete Mathematics 308(17): 4018-4023 (2008) |
| 51 | EE | Ernest J. Cockayne,
Odile Favaron,
S. Finbow,
Christina M. Mynhardt:
Open irredundance and maximum degree in graphs.
Discrete Mathematics 308(23): 5358-5375 (2008) |
| 50 | EE | Odile Favaron,
H. Karami,
S. M. Sheikholeslami:
Paired-domination number of a graph and its complement.
Discrete Mathematics 308(24): 6601-6605 (2008) |
| 49 | EE | Odile Favaron,
Adriana Hansberg,
Lutz Volkmann:
On k-domination and minimum degree in graphs.
Journal of Graph Theory 57(1): 33-40 (2008) |
| 2007 |
|---|
| 48 | EE | 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 |
|---|
| 47 | | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
Total domination in Kr-covered graphs.
Ars Comb. 71: (2004) |
| 46 | EE | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
On i--ER-critical graphs.
Discrete Mathematics 276(1-3): 111-125 (2004) |
| 45 | EE | Odile Favaron,
Michael A. Henning:
Paired-Domination in Claw-Free Cubic Graphs.
Graphs and Combinatorics 20(4): 447-456 (2004) |
| 2003 |
|---|
| 44 | EE | 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) |
| 43 | EE | Odile Favaron:
Independence and upper irredundance in claw-free graphs.
Discrete Applied Mathematics 132(1-3): 85-95 (2003) |
| 42 | EE | Odile Favaron,
Gerd Fricke,
Dan Pritikin,
Joël Puech:
Irredundance and domination in kings graphs.
Discrete Mathematics 262(1-3): 131-147 (2003) |
| 41 | EE | 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) |
| 2002 |
|---|
| 40 | EE | Odile Favaron,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Douglas F. Rall:
On k-dependent domination.
Discrete Mathematics 249(1-3): 83-94 (2002) |
| 39 | EE | 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) |
| 38 | EE | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
On the Randic Image index.
Discrete Mathematics 257(1): 29-38 (2002) |
| 37 | EE | Gábor Bacsó,
Odile Favaron:
Independence, irredundance, degrees and chromatic number in graphs.
Discrete Mathematics 259(1-3): 257-262 (2002) |
| 36 | EE | Charles Delorme,
Odile Favaron,
Dieter Rautenbach:
On the reconstruction of the degree sequence.
Discrete Mathematics 259(1-3): 293-300 (2002) |
| 2001 |
|---|
| 35 | | 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) |
| 34 | EE | 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) |
| 33 | EE | 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) |
| 32 | EE | 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) |
| 31 | EE | Odile Favaron:
Inflated graphs with equal independence number and upper irredundance number.
Discrete Mathematics 236(1-3): 81-94 (2001) |
| 30 | EE | Odile Favaron,
Pierre Fraisse:
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs.
J. Comb. Theory, Ser. B 82(2): 297-305 (2001) |
| 29 | EE | Odile Favaron,
Y. Redouane:
Neighborhood unions and regularity in graphs.
Theor. Comput. Sci. 263(1-2): 247-254 (2001) |
| 2000 |
|---|
| 28 | EE | Odile Favaron:
Extendability and factor-criticality.
Discrete Mathematics 213(1-3): 115-122 (2000) |
| 27 | EE | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
On i-minus-Edge-Removal-critical graphs.
Electronic Notes in Discrete Mathematics 5: 64-66 (2000) |
| 1999 |
|---|
| 26 | EE | Jan Brousek,
Zdenek Ryjácek,
Odile Favaron:
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs.
Discrete Mathematics 196(1-3): 29-50 (1999) |
| 25 | EE | Odile Favaron,
Joël Puech:
Irredundant and perfect neighborhood sets in graphs and claw-free graphs.
Discrete Mathematics 197-198: 269-284 (1999) |
| 24 | EE | 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) |
| 23 | EE | Odile Favaron,
Evelyne Flandrin,
Hao Li,
Feng Tian:
An Ore-type condition for pancyclability.
Discrete Mathematics 206(1-3): 139-144 (1999) |
| 1998 |
|---|
| 22 | EE | Odile Favaron,
Joël Puech:
Irredundance in grids.
Discrete Mathematics 179(1-3): 257-265 (1998) |
| 21 | EE | Ahmed Ainouche,
Odile Favaron,
Hao Li:
Global insertion and hamiltonicity in DCT-graphs.
Discrete Mathematics 184(1-3): 1-13 (1998) |
| 1997 |
|---|
| 20 | EE | 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) |
| 1996 |
|---|
| 19 | | Odile Favaron,
Evelyne Flandrin,
Hao Li,
Zdenek Ryjácek:
Shortest walks in almost claw-free graphs.
Ars Comb. 42: (1996) |
| 18 | | Odile Favaron,
Christina M. Mynhardt:
On the sizes of least common multiples of several pairs of graphs.
Ars Comb. 43: (1996) |
| 17 | EE | Odile Favaron:
Least domination in a graph.
Discrete Mathematics 150(1-3): 115-122 (1996) |
| 16 | EE | Odile Favaron:
Signed domination in regular graphs.
Discrete Mathematics 158(1-3): 287-293 (1996) |
| 15 | EE | Odile Favaron,
Hao Li,
Richard H. Schelp:
Strong edge colorings of graphs.
Discrete Mathematics 159(1-3): 103-109 (1996) |
| 14 | EE | Ernest J. Cockayne,
Odile Favaron,
Christina M. Mynhardt:
Universal maximal packing functions of graphs.
Discrete Mathematics 159(1-3): 57-68 (1996) |
| 1994 |
|---|
| 13 | EE | Odile Favaron,
Jean-Luc Fouquet:
On m-centers in Pt-free graphs.
Discrete Mathematics 125(1-3): 147-152 (1994) |
| 1993 |
|---|
| 12 | EE | 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) |
| 11 | EE | Odile Favaron:
A note on the irredundance number after vertex deletion.
Discrete Mathematics 121(1-3): 51-54 (1993) |
| 10 | EE | Odile Favaron,
Pedro Mago,
Oscar Ordaz:
On the bipartite independence number of a balanced bipartite graph.
Discrete Mathematics 121(1-3): 55-63 (1993) |
| 9 | | 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 |
|---|
| 8 | EE | 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) |
| 1990 |
|---|
| 7 | EE | 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 |
|---|
| 6 | EE | 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) |
| 1988 |
|---|
| 5 | EE | Odile Favaron:
Two relations between the parameters of independence and irredundance.
Discrete Mathematics 70(1): 17-20 (1988) |
| 1986 |
|---|
| 4 | EE | Odile Favaron,
Oscar Ordaz:
A sufficient condition for oriented graphs to be Hamiltonian.
Discrete Mathematics 58(3): 243-252 (1986) |
| 1985 |
|---|
| 3 | EE | 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 |
|---|
| 2 | EE | Odile Favaron:
Very well covered graphs.
Discrete Mathematics 42(2-3): 177-187 (1982) |
| 1981 |
|---|
| 1 | EE | 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) |
