Odile Favaron

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 3

Top Venues

J. Comb. Optim.

Ars Comb.

Discret. Appl. Math.

Appl. Math. Comput.

Publications

Pawaton Kaemawichanurat, Odile Favaron
Partial domination and irredundance numbers in graphs. Appl. Math. Comput. 457 (2023)
Odile Favaron, Pawaton Kaemawichanurat
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph. Discret. Appl. Math. 289 (2021)
Selma Djelloul, Odile Favaron, Mekkia Kouider
Edge k-q-Colorability of Graphs. J. Graph Algorithms Appl. 22 (2) (2018)
Odile Favaron, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
Signed k-domatic numbers of graphs. Ars Comb. 123 (2015)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Game domination subdivision number of a graph. J. Comb. Optim. 30 (1) (2015)
Odile Favaron, Mekkia Kouider
Even Factors of Large Size. J. Graph Theory 77 (1) (2014)
Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
Independent [1, k]-sets in graphs. Australas. J Comb. 59 (2014)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
On the total outer-connected domination in graphs. J. Comb. Optim. 27 (3) (2014)
Odile Favaron, Rana Khoeilar, Seyed Mahmoud Sheikholeslami
Total outer-Connected domination subdivision numbers in graphs. Discret. Math. Algorithms Appl. 5 (3) (2013)
M. H. Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
On the outer-connected domination in graphs. J. Comb. Optim. 26 (1) (2013)
Odile Favaron
-domatic number of a graph. Discuss. Math. Graph Theory 33 (4) (2013)
Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann
k-Domination and k-Independence in Graphs: A Survey. Graphs Comb. 28 (1) (2012)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Bounding the total domination subdivision number of a graph in terms of its order. J. Comb. Optim. 21 (2) (2011)
M. H. Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Inequalities of Nordhaus-Gaddum type for doubly connected domination number. Discret. Appl. Math. 158 (14) (2010)
Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami
On the total domination subdivision number in some classes of graphs. J. Comb. Optim. 20 (1) (2010)
Odile Favaron, François Genest, Mekkia Kouider
Regular path decompositions of odd regular graphs. J. Graph Theory 63 (2) (2010)
S. Arumugam, Odile Favaron, S. Sudha
Irredundance saturation number of a graph. Australas. J Comb. 46 (2010)
Odile Favaron, Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami
Matchings and total domination subdivision number in graphs with few induced 4-cycles. Discuss. Math. Graph Theory 30 (4) (2010)
Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
Proof of a conjecture on game domination. J. Graph Theory 64 (4) (2010)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Paired-Domination Subdivision Numbers of Graphs. Graphs Comb. 25 (4) (2009)
Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami
On the Roman domination number of a graph. Discret. Math. 309 (10) (2009)
Hamideh Aram, Seyed Mahmoud Sheikholeslami, Odile Favaron
Domination subdivision numbers of trees. Discret. Math. 309 (4) (2009)
Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami
A New Bound on the Total Domination Subdivision Number. Graphs Comb. 25 (1) (2009)
Mustapha Aouchiche, Odile Favaron, Pierre Hansen
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille. RAIRO Oper. Res. 43 (4) (2009)
Mustapha Aouchiche, Odile Favaron, Pierre Hansen
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. Discret. Appl. Math. 157 (17) (2009)
Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah
Maximal k-independent sets in graphs. Discuss. Math. Graph Theory 28 (1) (2008)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Paired-domination number of a graph and its complement. Discret. Math. 308 (24) (2008)
Odile Favaron, Michael A. Henning
Total domination in claw-free graphs with minimum degree 2. Discret. Math. 308 (15) (2008)
Odile Favaron, Michael A. Henning
Bounds on total domination in claw-free cubic graphs. Discret. Math. 308 (16) (2008)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Disproof of a Conjecture on the Subdivision Domination Number of a Graph. Graphs Comb. 24 (4) (2008)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Total domination and total domination subdivision number of a graph and its complement. Discret. Math. 308 (17) (2008)
Odile Favaron, Adriana Hansberg, Lutz Volkmann
-domination and minimum degree in graphs. J. Graph Theory 57 (1) (2008)
Mostafa Blidia, Odile Favaron, Rahma Lounes
Locating-domination, 2-domination and independence in trees. Australas. J Comb. 42 (2008)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Total Domination in K5- and K6-covered graphs. Discret. Math. Theor. Comput. Sci. 10 (1) (2008)
Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt
Open irredundance and maximum degree in graphs. Discret. Math. 308 (23) (2008)
Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Dalila Raber
Ratios of some domination parameters in trees. Discret. Math. 308 (17) (2008)
Odile Favaron
Global Alliances and Independent Domination in Some Classes of Graphs. Electron. J. Comb. 15 (1) (2008)
Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
Total domination and total domination subdivision numbers. Australas. J Comb. 38 (2007)
Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah
On k-independence in graphs with emphasis on trees. Discret. Math. 307 (17-18) (2007)
Odile Favaron, Renu C. Laskar, Dieter Rautenbach
t-partitions and s-complete t-partitions of a graph. Australas. J Comb. 36 (2006)
Mostafa Blidia, Mustapha Chellali, Odile Favaron
Independence and 2-domination in trees. Australas. J Comb. 33 (2005)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Total domination in Kr-covered graphs. Ars Comb. 71 (2004)
Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs
Offensive alliances in graphs. Discuss. Math. Graph Theory 24 (2) (2004)
Odile Favaron, Michael A. Henning
Paired-Domination in Claw-Free Cubic Graphs. Graphs Comb. 20 (4) (2004)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
-ER-critical graphs. Discret. Math. 276 (1-3) (2004)
Odile Favaron, Michael A. Henning
Upper total domination in claw-free graphs. J. Graph Theory 44 (2) (2003)
Charles Delorme, Odile Favaron, Dieter Rautenbach
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. Discret. Appl. Math. 130 (3) (2003)
Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech
Irredundance and domination in kings graphs. Discret. Math. 262 (1-3) (2003)
Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
Changing upper irredundance by edge addition. Discret. Math. 266 (1-3) (2003)
Odile Favaron
Independence and upper irredundance in claw-free graphs. Discret. Appl. Math. 132 (1-3) (2003)
Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
Total irredundance in graphs. Discret. Math. 256 (1-2) (2002)
Charles Delorme, Odile Favaron, Dieter Rautenbach
On the reconstruction of the degree sequence. Discret. Math. 259 (1-3) (2002)
Gábor Bacsó, Odile Favaron
Independence, irredundance, degrees and chromatic number in graphs. Discret. Math. 259 (1-3) (2002)
Charles Delorme, Odile Favaron, Dieter Rautenbach
On the Randic Image index. Discret. Math. 257 (1) (2002)
Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
-dependent domination. Discret. Math. 249 (1-3) (2002)
Odile Favaron, Pierre Fraisse
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. J. Comb. Theory, Ser. B 82 (2) (2001)
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)
Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Clique covering and degree conditions for hamiltonicity in claw-free graphs. Discret. Math. 236 (1-3) (2001)
Odile Favaron
Inflated graphs with equal independence number and upper irredundance number. Discret. Math. 236 (1-3) (2001)
Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
Ramsey properties of generalised irredundant sets in graphs. Discret. Math. 231 (1-3) (2001)
Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach
On domination and annihilation in graphs with claw-free blocks. Discret. Math. 231 (1-3) (2001)
Odile Favaron, Y. Redouane
Neighborhood unions and regularity in graphs. Theor. Comput. Sci. 263 (1-2) (2001)
Odile Favaron
Extendability and factor-criticality. Discret. Math. 213 (1-3) (2000)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
)-trees. J. Graph Theory 34 (4) (2000)
Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech
Total domination in graphs with minimum degree three. J. Graph Theory 34 (1) (2000)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5 (2000)
Stephan Brandt, Odile Favaron, Zdenek Ryjácek
Closure and stable Hamiltonian properties in claw-free graphs. J. Graph Theory 34 (1) (2000)
Mao-cheng Cai, Odile Favaron, Hao Li
(2, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15 (2) (1999)
Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian
An Ore-type condition for pancyclability. Discret. Math. 206 (1-3) (1999)
Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu
On 2-factors in claw-free graphs. Discret. Math. 206 (1-3) (1999)
Odile Favaron, Joël Puech
Irredundant and perfect neighborhood sets in graphs and claw-free graphs. Discret. Math. (1999)
Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron
(3, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15 (4) (1999)
Jan Brousek, Zdenek Ryjácek, Odile Favaron
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discret. Math. 196 (1-3) (1999)
Odile Favaron, Minyong Shi
Minimally k-factor-critical graphs. Australas. J Comb. 17 (1998)
Odile Favaron, Joël Puech
Irredundance in grids. Discret. Math. 179 (1-3) (1998)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech
An inequality chain of domination parameters for trees. Discuss. Math. Graph Theory 18 (1) (1998)
Ernest J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt
Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs. Australas. J Comb. 18 (1998)
Ahmed Ainouche, Odile Favaron, Hao Li
Global insertion and hamiltonicity in DCT-graphs. Discret. Math. 184 (1-3) (1998)
Odile Favaron
Irredundance in inflated graphs. J. Graph Theory 28 (2) (1998)
Odile Favaron, Y. Redouane
-free graphs. Discret. Math. (1997)
Odile Favaron, Feng Tian, Lei Zhang
Independence and hamiltonicity in 3-domination-critical graphs. J. Graph Theory 25 (3) (1997)
Odile Favaron, Zdenek Ryjácek
Factor-criticality and matching extension in DCT-graphs. Discuss. Math. Graph Theory 17 (2) (1997)
Odile Favaron, Christina M. Mynhardt
On equality in an upper bound for domination parameters of graphs. J. Graph Theory 24 (3) (1997)
Odile Favaron, Christina M. Mynhardt
On the sizes of least common multiples of several pairs of graphs. Ars Comb. 43 (1996)
Odile Favaron
Least domination in a graph. Discret. Math. 150 (1-3) (1996)
Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li
Pancyclism and small cycles in graphs. Discuss. Math. Graph Theory 16 (1) (1996)
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
Universal maximal packing functions of graphs. Discret. Math. 159 (1-3) (1996)
Odile Favaron
On k-factor-critical graphs. Discuss. Math. Graph Theory 16 (1) (1996)
Odile Favaron, Hao Li, Richard H. Schelp
Strong edge colorings of graphs. Discret. Math. 159 (1-3) (1996)
Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
Shortest walks in almost claw-free graphs. Ars Comb. 42 (1996)
Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu
Sequences, claws and cyclability of graphs. J. Graph Theory 21 (4) (1996)
Odile Favaron
Signed domination in regular graphs. Discret. Math. 158 (1-3) (1996)
Denise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz
Biclosure and bistability in a balanced bipartite graph. J. Graph Theory 20 (4) (1995)
Odile Favaron, David P. Sumner, Ewa Wojcicka
-critical graphs. J. Graph Theory 18 (7) (1994)
Odile Favaron, Jean-Luc Fouquet
-free graphs. Discret. Math. 125 (1-3) (1994)
Odile Favaron, Pedro Mago, Oscar Ordaz
On the bipartite independence number of a balanced bipartite graph. Discret. Math. 121 (1-3) (1993)
Odile Favaron, Maryvonne Mahéo, Jean-François Saclé
Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discret. Math. 111 (1-3) (1993)
Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2. SIAM J. Discret. Math. 6 (2) (1993)
Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li
The complete closure of a graph. J. Graph Theory 17 (4) (1993)
Odile Favaron
A note on the irredundance number after vertex deletion. Discret. Math. 121 (1-3) (1993)

Odile Favaron.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Odile Favaron