default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOdile Favaron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j110]Pawaton Kaemawichanurat, Odile Favaron:
Partial domination and irredundance numbers in graphs. Appl. Math. Comput. 457: 128153 (2023)- 2021
- [j109]Odile Favaron, Pawaton Kaemawichanurat:
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph. Discret. Appl. Math. 289: 93-97 (2021)
2010 – 2019
- 2018
- [j108]Selma Djelloul, Odile Favaron, Mekkia Kouider:
Edge k-q-Colorability of Graphs. J. Graph Algorithms Appl. 22(2): 193-206 (2018) - 2015
- [j107]Odile Favaron, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed k-domatic numbers of graphs. Ars Comb. 123: 169-184 (2015) - [j106]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
:
Game domination subdivision number of a graph. J. Comb. Optim. 30(1): 109-119 (2015) - 2014
- [j105]Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Independent [1, k]-sets in graphs. Australas. J Comb. 59: 144-156 (2014) - [j104]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the total outer-connected domination in graphs. J. Comb. Optim. 27(3): 451-461 (2014) - [j103]Odile Favaron, Mekkia Kouider:
Even Factors of Large Size. J. Graph Theory 77(1): 58-67 (2014) - 2013
- [j102]Odile Favaron, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
Total outer-Connected domination subdivision numbers in graphs. Discret. Math. Algorithms Appl. 5(3) (2013) - [j101]Odile Favaron:
The b-domatic number of a graph. Discuss. Math. Graph Theory 33(4): 747-757 (2013) - [j100]Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the outer-connected domination in graphs. J. Comb. Optim. 26(1): 10-18 (2013) - 2012
- [r1]Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann:
k-Domination and k-Independence in Graphs: A Survey. Graphs Comb. 28(1): 1-55 (2012) - 2011
- [j99]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): 209-218 (2011) - 2010
- [j98]S. Arumugam, Odile Favaron, S. Sudha:
Irredundance saturation number of a graph. Australas. J Comb. 46: 37-50 (2010) - [j97]Mohammad Hadi 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): 1465-1470 (2010) - [j96]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): 611-618 (2010) - [j95]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): 76-84 (2010) - [j94]Odile Favaron, François Genest, Mekkia Kouider:
Regular path decompositions of odd regular graphs. J. Graph Theory 63(2): 114-128 (2010) - [j93]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Proof of a conjecture on game domination. J. Graph Theory 64(4): 323-329 (2010)
2000 – 2009
- 2009
- [j92]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): 3497-3510 (2009) - [j91]Hamideh Aram, Seyed Mahmoud Sheikholeslami, Odile Favaron:
Domination subdivision numbers of trees. Discret. Math. 309(4): 622-628 (2009) - [j90]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
On the Roman domination number of a graph. Discret. Math. 309(10): 3447-3451 (2009) - [j89]Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
A New Bound on the Total Domination Subdivision Number. Graphs Comb. 25(1): 41-47 (2009) - [j88]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Paired-Domination Subdivision Numbers of Graphs. Graphs Comb. 25(4): 503-512 (2009) - [j87]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): 339-358 (2009) - 2008
- [j86]Mostafa Blidia, Odile Favaron, Rahma Lounes:
Locating-domination, 2-domination and independence in trees. Australas. J Comb. 42: 309- (2008) - [j85]Odile Favaron:
Global Alliances and Independent Domination in Some Classes of Graphs. Electron. J. Comb. 15(1) (2008) - [j84]Odile Favaron, Michael A. Henning:
Total domination in claw-free graphs with minimum degree 2. Discret. Math. 308(15): 3213-3219 (2008) - [j83]Odile Favaron, Michael A. Henning:
Bounds on total domination in claw-free cubic graphs. Discret. Math. 308(16): 3491-3507 (2008) - [j82]Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Dalila Raber:
Ratios of some domination parameters in trees. Discret. Math. 308(17): 3879-3887 (2008) - [j81]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total domination and total domination subdivision number of a graph and its complement. Discret. Math. 308(17): 4018-4023 (2008) - [j80]Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt:
Open irredundance and maximum degree in graphs. Discret. Math. 308(23): 5358-5375 (2008) - [j79]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Paired-domination number of a graph and its complement. Discret. Math. 308(24): 6601-6605 (2008) - [j78]Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah:
Maximal k-independent sets in graphs. Discuss. Math. Graph Theory 28(1): 151-163 (2008) - [j77]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total Domination in K5- and K6-covered graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j76]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Disproof of a Conjecture on the Subdivision Domination Number of a Graph. Graphs Comb. 24(4): 309-312 (2008) - [j75]Odile Favaron, Adriana Hansberg, Lutz Volkmann:
On k-domination and minimum degree in graphs. J. Graph Theory 57(1): 33-40 (2008) - 2007
- [j74]Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total domination and total domination subdivision numbers. Australas. J Comb. 38: 229-236 (2007) - [j73]Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah:
On k-independence in graphs with emphasis on trees. Discret. Math. 307(17-18): 2209-2216 (2007) - 2006
- [j72]Odile Favaron, Renu C. Laskar, Dieter Rautenbach:
t-partitions and s-complete t-partitions of a graph. Australas. J Comb. 36: 295-302 (2006) - 2005
- [j71]Mostafa Blidia, Mustapha Chellali, Odile Favaron:
Independence and 2-domination in trees. Australas. J Comb. 33: 317-328 (2005) - 2004
- [j70]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
Total domination in Kr-covered graphs. Ars Comb. 71 (2004) - [j69]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
On i--ER-critical graphs. Discret. Math. 276(1-3): 111-125 (2004) - [j68]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): 263-175 (2004) - [j67]Odile Favaron, Michael A. Henning:
Paired-Domination in Claw-Free Cubic Graphs. Graphs Comb. 20(4): 447-456 (2004) - 2003
- [j66]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): 503-512 (2003) - [j65]Odile Favaron:
Independence and upper irredundance in claw-free graphs. Discret. Appl. Math. 132(1-3): 85-95 (2003) - [j64]Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech:
Irredundance and domination in kings graphs. Discret. Math. 262(1-3): 131-147 (2003) - [j63]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): 185-193 (2003) - [j62]Odile Favaron, Michael A. Henning:
Upper total domination in claw-free graphs. J. Graph Theory 44(2): 148-158 (2003) - 2002
- [j61]Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
On k-dependent domination. Discret. Math. 249(1-3): 83-94 (2002) - [j60]Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Total irredundance in graphs. Discret. Math. 256(1-2): 115-127 (2002) - [j59]Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the Randic Image index. Discret. Math. 257(1): 29-38 (2002) - [j58]Gábor Bacsó, Odile Favaron:
Independence, irredundance, degrees and chromatic number in graphs. Discret. Math. 259(1-3): 257-262 (2002) - [j57]Charles Delorme, Odile Favaron, Dieter Rautenbach:
On the reconstruction of the degree sequence. Discret. Math. 259(1-3): 293-300 (2002) - 2001
- [j56]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) - [j55]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): 123-134 (2001) - [j54]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): 143-151 (2001) - [j53]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): 65-80 (2001) - [j52]Odile Favaron:
Inflated graphs with equal independence number and upper irredundance number. Discret. Math. 236(1-3): 81-94 (2001) - [j51]Odile Favaron, Pierre Fraisse:
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. J. Comb. Theory B 82(2): 297-305 (2001) - [j50]Odile Favaron, Y. Redouane:
Neighborhood unions and regularity in graphs. Theor. Comput. Sci. 263(1-2): 247-254 (2001) - 2000
- [j49]Odile Favaron:
Extendability and factor-criticality. Discret. Math. 213(1-3): 115-122 (2000) - [j48]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5: 64-66 (2000) - [j47]Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech:
Total domination in graphs with minimum degree three. J. Graph Theory 34(1): 9-19 (2000) - [j46]Stephan Brandt, Odile Favaron, Zdenek Ryjácek:
Closure and stable Hamiltonian properties in claw-free graphs. J. Graph Theory 34(1): 30-41 (2000) - [j45]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt, Joël Puech:
A characterization of (γ, i)-trees. J. Graph Theory 34(4): 277-292 (2000)
1990 – 1999
- 1999
- [j44]Jan Brousek, Zdenek Ryjácek, Odile Favaron:
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. Discret. Math. 196(1-3): 29-50 (1999) - [j43]Odile Favaron, Joël Puech:
Irredundant and perfect neighborhood sets in graphs and claw-free graphs. Discret. Math. 197-198: 269-284 (1999) - [j42]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu:
On 2-factors in claw-free graphs. Discret. Math. 206(1-3): 131-137 (1999) - [j41]Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian:
An Ore-type condition for pancyclability. Discret. Math. 206(1-3): 139-144 (1999) - [j40]Mao-cheng Cai, Odile Favaron, Hao Li:
(2, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15(2): 137-142 (1999) - [j39]Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron:
(3, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15(4): 463-471 (1999) - 1998
- [j38]Odile Favaron, Minyong Shi:
Minimally k-factor-critical graphs. Australas. J Comb. 17: 89-98 (1998) - [j37]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: 253-262 (1998) - [j36]Odile Favaron, Joël Puech:
Irredundance in grids. Discret. Math. 179(1-3): 257-265 (1998) - [j35]Ahmed Ainouche, Odile Favaron, Hao Li:
Global insertion and hamiltonicity in DCT-graphs. Discret. Math. 184(1-3): 1-13 (1998) - [j34]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): 127-142 (1998) - [j33]Odile Favaron:
Irredundance in inflated graphs. J. Graph Theory 28(2): 97-104 (1998) - 1997
- [j32]Odile Favaron, Y. Redouane:
Minimum independent generalized t-degree and independence number in K1, r+1-free graphs. Discret. Math. 165-166: 253-261 (1997) - [j31]Odile Favaron, Zdenek Ryjácek:
Factor-criticality and matching extension in DCT-graphs. Discuss. Math. Graph Theory 17(2): 271-278 (1997) - [j30]Odile Favaron, Christina M. Mynhardt:
On equality in an upper bound for domination parameters of graphs. J. Graph Theory 24(3): 221-231 (1997) - [j29]Odile Favaron, Feng Tian, Lei Zhang:
Independence and hamiltonicity in 3-domination-critical graphs. J. Graph Theory 25(3): 173-184 (1997) - 1996
- [j28]Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
Shortest walks in almost claw-free graphs. Ars Comb. 42 (1996) - [j27]Odile Favaron, Christina M. Mynhardt:
On the sizes of least common multiples of several pairs of graphs. Ars Comb. 43 (1996) - [j26]Odile Favaron:
Least domination in a graph. Discret. Math. 150(1-3): 115-122 (1996) - [j25]Odile Favaron:
Signed domination in regular graphs. Discret. Math. 158(1-3): 287-293 (1996) - [j24]Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
Universal maximal packing functions of graphs. Discret. Math. 159(1-3): 57-68 (1996) - [j23]Odile Favaron, Hao Li, Richard H. Schelp:
Strong edge colorings of graphs. Discret. Math. 159(1-3): 103-109 (1996) - [j22]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
Pancyclism and small cycles in graphs. Discuss. Math. Graph Theory 16(1): 27-40 (1996) - [j21]Odile Favaron:
On k-factor-critical graphs. Discuss. Math. Graph Theory 16(1): 41-51 (1996) - [j20]Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu:
Sequences, claws and cyclability of graphs. J. Graph Theory 21(4): 357-369 (1996) - 1995
- [j19]Denise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz:
Biclosure and bistability in a balanced bipartite graph. J. Graph Theory 20(4): 513-529 (1995) - 1994
- [j18]Odile Favaron, Jean-Luc Fouquet:
On m-centers in Pt-free graphs. Discret. Math. 125(1-3): 147-152 (1994) - [j17]Odile Favaron, David P. Sumner, Ewa Wojcicka:
The diameter of domination k-critical graphs. J. Graph Theory 18(7): 723-734 (1994) - 1993
- [j16]Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
Some eigenvalue properties in graphs (conjectures of Graffiti - II). Discret. Math. 111(1-3): 197-220 (1993) - [j15]Odile Favaron:
A note on the irredundance number after vertex deletion. Discret. Math. 121(1-3): 51-54 (1993) - [j14]Odile Favaron, Pedro Mago, Oscar Ordaz:
On the bipartite independence number of a balanced bipartite graph. Discret. Math. 121(1-3): 55-63 (1993) - [j13]Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
The complete closure of a graph. J. Graph Theory 17(4): 481-494 (1993) - [j12]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): 189-196 (1993) - 1992
- [j11]Charles Delorme, Odile Favaron, Maryvonne Mahéo:
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups. Eur. J. Comb. 13(1): 59-61 (1992) - 1991
- [j10]Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray:
The product of the independent domination numbers of a graph and its complement. Discret. Math. 90(3): 313-317 (1991) - [j9]Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
On the residue of a graph. J. 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. Discret. Math. 91(3): 311-316 (1990)
1980 – 1989
- 1989
- [j7]Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo:
Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Theory 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. Discret. Math. 70(1): 17-20 (1988) - 1986
- [j4]Odile Favaron, Oscar Ordaz:
A sufficient condition for oriented graphs to be Hamiltonian. Discret. Math. 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 B 39(1): 101-102 (1985) - 1982
- [j2]Odile Favaron:
Very well covered graphs. Discret. Math. 42(2-3): 177-187 (1982) - 1981
- [j1]Ernest J. Cockayne, Odile Favaron, C. Payan, Andrew G. Thomason:
Contributions to the theory of domination, independence and irredundance in graphs. Discret. Math. 33(3): 249-258 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
