Odile Favaron

According to our database1, Odile Favaron authored at least 111 papers between 1981 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Partial domination and irredundance numbers in graphs.
Appl. Math. Comput., November, 2023

2021
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph.
Discret. Appl. Math., 2021

2018
Edge k-q-Colorability of Graphs.
J. Graph Algorithms Appl., 2018

2015
Game domination subdivision number of a graph.
J. Comb. Optim., 2015

Signed k-domatic numbers of graphs.
Ars Comb., 2015

2014
Even Factors of Large Size.
J. Graph Theory, 2014

On the total outer-connected domination in graphs.
J. Comb. Optim., 2014

Independent [1, k]-sets in graphs.
Australas. J Comb., 2014

2013
On the outer-connected domination in graphs.
J. Comb. Optim., 2013

The <i>b</i>-domatic number of a graph.
Discuss. Math. Graph Theory, 2013

Total outer-Connected domination subdivision numbers in graphs.
Discret. Math. Algorithms Appl., 2013

2012
k-Domination and k-Independence in Graphs: A Survey.
Graphs Comb., 2012

2011
Bounding the total domination subdivision number of a graph in terms of its order.
J. Comb. Optim., 2011

2010
Proof of a conjecture on game domination.
J. Graph Theory, 2010

Regular path decompositions of odd regular graphs.
J. Graph Theory, 2010

On the total domination subdivision number in some classes of graphs.
J. Comb. Optim., 2010

Matchings and total domination subdivision number in graphs with few induced 4-cycles.
Discuss. Math. Graph Theory, 2010

Inequalities of Nordhaus-Gaddum type for doubly connected domination number.
Discret. Appl. Math., 2010

Irredundance saturation number of a graph.
Australas. J Comb., 2010

2009
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille.
RAIRO Oper. Res., 2009

Paired-Domination Subdivision Numbers of Graphs.
Graphs Comb., 2009

A New Bound on the Total Domination Subdivision Number.
Graphs Comb., 2009

On the Roman domination number of a graph.
Discret. Math., 2009

Domination subdivision numbers of trees.
Discret. Math., 2009

Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance.
Discret. Appl. Math., 2009

2008
On <i>k</i>-domination and minimum degree in graphs.
J. Graph Theory, 2008

Disproof of a Conjecture on the Subdivision Domination Number of a Graph.
Graphs Comb., 2008

Total Domination in K5- and K6-covered graphs.
Discret. Math. Theor. Comput. Sci., 2008

Maximal k-independent sets in graphs.
Discuss. Math. Graph Theory, 2008

Paired-domination number of a graph and its complement.
Discret. Math., 2008

Total domination and total domination subdivision number of a graph and its complement.
Discret. Math., 2008

Bounds on total domination in claw-free cubic graphs.
Discret. Math., 2008

Total domination in claw-free graphs with minimum degree 2.
Discret. Math., 2008

Open irredundance and maximum degree in graphs.
Discret. Math., 2008

Ratios of some domination parameters in trees.
Discret. Math., 2008

Global Alliances and Independent Domination in Some Classes of Graphs.
Electron. J. Comb., 2008

Locating-domination, 2-domination and independence in trees.
Australas. J Comb., 2008

2007
On k-independence in graphs with emphasis on trees.
Discret. Math., 2007

Total domination and total domination subdivision numbers.
Australas. J Comb., 2007

2006
t-partitions and s-complete t-partitions of a graph.
Australas. J Comb., 2006

2005
Independence and 2-domination in trees.
Australas. J Comb., 2005

2004
Paired-Domination in Claw-Free Cubic Graphs.
Graphs Comb., 2004

Offensive alliances in graphs.
Discuss. Math. Graph Theory, 2004

On i<sup>-</sup>-ER-critical graphs.
Discret. Math., 2004

Total domination in Kr-covered graphs.
Ars Comb., 2004

2003
Upper total domination in claw-free graphs.
J. Graph Theory, 2003

Irredundance and domination in kings graphs.
Discret. Math., 2003

Changing upper irredundance by edge addition.
Discret. Math., 2003

Independence and upper irredundance in claw-free graphs.
Discret. Appl. Math., 2003

Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
Discret. Appl. Math., 2003

2002
On <i>k</i>-dependent domination.
Discret. Math., 2002

Total irredundance in graphs.
Discret. Math., 2002

On the Randic Image index.
Discret. Math., 2002

On the reconstruction of the degree sequence.
Discret. Math., 2002

Independence, irredundance, degrees and chromatic number in graphs.
Discret. Math., 2002

2001
Neighborhood unions and regularity in graphs.
Theor. Comput. Sci., 2001

Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs.
J. Comb. Theory, Ser. B, 2001

On domination and annihilation in graphs with claw-free blocks.
Discret. Math., 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.
Discret. Math., 2001

Inflated graphs with equal independence number and upper irredundance number.
Discret. Math., 2001

Ramsey properties of generalised irredundant sets in graphs.
Discret. Math., 2001

Generalised Ramsey Numbers with respect to Classes of Graphs.
Ars Comb., 2001

2000
Total domination in graphs with minimum degree three.
J. Graph Theory, 2000

A characterization of (γ, <i>i</i>)-trees.
J. Graph Theory, 2000

Closure and stable Hamiltonian properties in claw-free graphs.
J. Graph Theory, 2000

On i-minus-Edge-Removal-critical graphs.
Electron. Notes Discret. Math., 2000

Extendability and factor-criticality.
Discret. Math., 2000

1999
(3, k)-Factor-Critical Graphs and Toughness.
Graphs Comb., 1999

(2, k)-Factor-Critical Graphs and Toughness.
Graphs Comb., 1999

Irredundant and perfect neighborhood sets in graphs and claw-free graphs.
Discret. Math., 1999

An Ore-type condition for pancyclability.
Discret. Math., 1999

On 2-factors in claw-free graphs.
Discret. Math., 1999

Forbidden subgraphs, hamiltonicity and closure in claw-free graphs.
Discret. Math., 1999

1998
Irredundance in inflated graphs.
J. Graph Theory, 1998

An inequality chain of domination parameters for trees.
Discuss. Math. Graph Theory, 1998

Irredundance in grids.
Discret. Math., 1998

Global insertion and hamiltonicity in DCT-graphs.
Discret. Math., 1998

Minimally k-factor-critical graphs.
Australas. J Comb., 1998

Packing, perfect neighbourhood, irredundant and R-annihilated sets in graphs.
Australas. J Comb., 1998

1997
Independence and hamiltonicity in 3-domination-critical graphs.
J. Graph Theory, 1997

On equality in an upper bound for domination parameters of graphs.
J. Graph Theory, 1997

Factor-criticality and matching extension in DCT-graphs.
Discuss. Math. Graph Theory, 1997

Minimum independent generalized t-degree and independence number in K<sub>1, r+1</sub>-free graphs.
Discret. Math., 1997

1996
Sequences, claws and cyclability of graphs.
J. Graph Theory, 1996

On k-factor-critical graphs.
Discuss. Math. Graph Theory, 1996

Pancyclism and small cycles in graphs.
Discuss. Math. Graph Theory, 1996

Strong edge colorings of graphs.
Discret. Math., 1996

Signed domination in regular graphs.
Discret. Math., 1996

Least domination in a graph.
Discret. Math., 1996

Universal maximal packing functions of graphs.
Discret. Math., 1996

On the sizes of least common multiples of several pairs of graphs.
Ars Comb., 1996

Shortest walks in almost claw-free graphs.
Ars Comb., 1996

1995
Biclosure and bistability in a balanced bipartite graph.
J. Graph Theory, 1995

1994
The diameter of domination <i>k</i>-critical graphs.
J. Graph Theory, 1994

On m-centers in P<sub>t</sub>-free graphs.
Discret. Math., 1994

1993
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2.
SIAM J. Discret. Math., 1993

The complete closure of a graph.
J. Graph Theory, 1993

Some eigenvalue properties in graphs (conjectures of Graffiti - II).
Discret. Math., 1993

On the bipartite independence number of a balanced bipartite graph.
Discret. Math., 1993

A note on the irredundance number after vertex deletion.
Discret. Math., 1993

1992
Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups.
Eur. J. Comb., 1992

1991
On the residue of a graph.
J. Graph Theory, 1991

The product of the independent domination numbers of a graph and its complement.
Discret. Math., 1991

1990
A parameter linked with G-factors and the binding number.
Discret. Math., 1990

1989
Edge-vulnerability and mean distance.
Networks, 1989

Hamiltonian decomposition of Cayley graphs of degree 4.
J. Comb. Theory, Ser. B, 1989

1988
Two relations between the parameters of independence and irredundance.
Discret. Math., 1988

1986
A sufficient condition for oriented graphs to be Hamiltonian.
Discret. Math., 1986

1985
On a conjecture of Fink and Jacobson concerning <i>k</i>-domination and <i>k</i>-dependence.
J. Comb. Theory, Ser. B, 1985

1982
Very well covered graphs.
Discret. Math., 1982

1981
Contributions to the theory of domination, independence and irredundance in graphs.
Discret. Math., 1981


  Loading...