The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Odile Favaron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
    Generalised Ramsey Numbers with respect to Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  2. Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
    Total domination in Kr-covered graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:71, n:, pp:- [Journal]
  3. Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Shortest walks in almost claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:42, n:, pp:- [Journal]
  4. Odile Favaron, Christina M. Mynhardt
    On the sizes of least common multiples of several pairs of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  5. Charles Delorme, Odile Favaron, Dieter Rautenbach
    Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:503-512 [Journal]
  6. Odile Favaron
    Independence and upper irredundance in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:85-95 [Journal]
  7. Gábor Bacsó, Odile Favaron
    Independence, irredundance, degrees and chromatic number in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:257-262 [Journal]
  8. Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
    Changing upper irredundance by edge addition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:185-193 [Journal]
  9. Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech
    Ramsey properties of generalised irredundant sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:123-134 [Journal]
  10. Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
    On i--ER-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:111-125 [Journal]
  11. Charles Delorme, Odile Favaron, Dieter Rautenbach
    On the reconstruction of the degree sequence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:293-300 [Journal]
  12. Charles Delorme, Odile Favaron, Dieter Rautenbach
    On the Randic Image index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:1, pp:29-38 [Journal]
  13. Odile Favaron
    Extendability and factor-criticality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:115-122 [Journal]
  14. Odile Favaron
    Inflated graphs with equal independence number and upper irredundance number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:81-94 [Journal]
  15. Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Clique covering and degree conditions for hamiltonicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:65-80 [Journal]
  16. Odile Favaron, Gerd Fricke, Dan Pritikin, Joël Puech
    Irredundance and domination in kings graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:131-147 [Journal]
  17. Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
    Total irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:115-127 [Journal]
  18. Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
    On k-dependent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:83-94 [Journal]
  19. Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach
    On domination and annihilation in graphs with claw-free blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:143-151 [Journal]
  20. Odile Favaron, Michael A. Henning
    Paired-Domination in Claw-Free Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:447-456 [Journal]
  21. Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo
    Hamiltonian decomposition of Cayley graphs of degree 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:142-153 [Journal]
  22. Odile Favaron
    On a conjecture of Fink and Jacobson concerning k-domination and k-dependence. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:1, pp:101-102 [Journal]
  23. Odile Favaron, Pierre Fraisse
    Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:297-305 [Journal]
  24. Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz
    Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:2, pp:189-196 [Journal]
  25. Odile Favaron, Y. Redouane
    Neighborhood unions and regularity in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:247-254 [Journal]
  26. Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason
    Contributions to the theory of domination, independence and irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:249-258 [Journal]
  27. Odile Favaron
    Very well covered graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:2-3, pp:177-187 [Journal]
  28. Odile Favaron, Oscar Ordaz
    A sufficient condition for oriented graphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:243-252 [Journal]
  29. Odile Favaron
    Two relations between the parameters of independence and irredundance. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:70, n:1, pp:17-20 [Journal]
  30. Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian
    An Ore-type condition for pancyclability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:139-144 [Journal]
  31. Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu
    On 2-factors in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:131-137 [Journal]
  32. Jan Brousek, Zdenek Ryjácek, Odile Favaron
    Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:196, n:1-3, pp:29-50 [Journal]
  33. Odile Favaron, Joël Puech
    Irredundant and perfect neighborhood sets in graphs and claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:269-284 [Journal]
  34. Ahmed Ainouche, Odile Favaron, Hao Li
    Global insertion and hamiltonicity in DCT-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:184, n:1-3, pp:1-13 [Journal]
  35. Odile Favaron, Joël Puech
    Irredundance in grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:257-265 [Journal]
  36. Odile Favaron, Y. Redouane
    Minimum independent generalized t-degree and independence number in K1, r+1-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:253-261 [Journal]
  37. Ernest J. Cockayne, Odile Favaron, Hao Li, Gary MacGillivray
    The product of the independent domination numbers of a graph and its complement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:3, pp:313-317 [Journal]
  38. Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
    A parameter linked with G-factors and the binding number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:91, n:3, pp:311-316 [Journal]
  39. Odile Favaron, Maryvonne Mahéo, Jean-François Saclé
    Some eigenvalue properties in graphs (conjectures of Graffiti - II). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:197-220 [Journal]
  40. Odile Favaron
    Least domination in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:115-122 [Journal]
  41. Odile Favaron
    Signed domination in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:158, n:1-3, pp:287-293 [Journal]
  42. Odile Favaron, Hao Li, Richard H. Schelp
    Strong edge colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:103-109 [Journal]
  43. Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
    Universal maximal packing functions of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:57-68 [Journal]
  44. Odile Favaron
    A note on the irredundance number after vertex deletion. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:51-54 [Journal]
  45. Odile Favaron, Pedro Mago, Oscar Ordaz
    On the bipartite independence number of a balanced bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:55-63 [Journal]
  46. Odile Favaron, Jean-Luc Fouquet
    On m-centers in Pt-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:147-152 [Journal]
  47. Mostafa Blidia, Mustapha Chellali, Odile Favaron, Nacéra Meddah
    On k-independence in graphs with emphasis on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:17-18, pp:2209-2216 [Journal]

  48. Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. [Citation Graph (, )][DBLP]


  49. Inequalities of Nordhaus-Gaddum type for doubly connected domination number. [Citation Graph (, )][DBLP]


  50. Ratios of some domination parameters in trees. [Citation Graph (, )][DBLP]


  51. Paired-domination number of a graph and its complement. [Citation Graph (, )][DBLP]


  52. Bounds on total domination in claw-free cubic graphs. [Citation Graph (, )][DBLP]


  53. Open irredundance and maximum degree in graphs. [Citation Graph (, )][DBLP]


  54. Total domination in claw-free graphs with minimum degree 2. [Citation Graph (, )][DBLP]


  55. Total domination and total domination subdivision number of a graph and its complement. [Citation Graph (, )][DBLP]


  56. On the Roman domination number of a graph. [Citation Graph (, )][DBLP]


  57. Domination subdivision numbers of trees. [Citation Graph (, )][DBLP]


  58. Total Domination in K5- and K6-covered graphs. [Citation Graph (, )][DBLP]


Search in 0.123secs, Finished in 0.128secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002